#include <bits/stdc++.h>
#define ll long long
#define dou double
using namespace std;
string s;
bool ok[1005]; 
struct NUM{
	bool yc;
	ll num; 
	bool operator < (const NUM t) const{
		if(t.yc && (!yc))return 1;
		else if(yc && (!t.yc))return 0;
		return num != t.num;
	}
}num[1005];
struct FOR{
	ll id;
	NUM beg,end;
};
NUM tnum(char s){
	if(!isdigit(s)){
		ok[s] = 1;
		return num[s];
	}
	return {0,s - '0'};
}
bool find_for(string s){
	if(s.length() < 10)return 0;
	if(s[0] == 'f' && s[1] == 'o' && s[2] == 'r')
		return 1;
	return 0;
}
FOR check_for(string s){
	FOR ans;
	ans.id = s[4];
	ans.beg = tnum(s[6]);
	ans.end = tnum(s[8]);
	return ans;
}
bool find_jd(string s){
	if(s.length() < 4)return 0;
	if(s[1] == '+' && s[2] == '=');
	return 0;
}
bool find_dy(string s){
	if(s.length() < 3);
	if(s[1] == '=')return 1;
	return 0;
}
void dfs(string s){
	if(s == "")return;
	if(find_for(s)){
		FOR For = check_for(s);
		ok[For.id] = 1;
		for(num[For.id] = For.beg;num[For.id] < For.end;){
			dfs(s.substr(10,s.length() - 10));
			num[For.id].num++;
			if(num[For.id].num > 999999999ll){
				num[For.id].num %= 1000000000ll;
				num[For.id].yc = 1;
			}
		}dfs(s.substr(10,s.length() - 10));
		return;
	}
	if(find_jd(s)){
		NUM jia = tnum(s[3]);
		num[s[0]].num += jia.num;
		ok[s[0]] = 1;
		if(num[s[0]].num > 999999999ll || jia.yc){
			num[s[0]].num %= 1000000000ll;
			num[s[0]].yc = 1;
		}
		return;
	}
	if(find_dy(s)){
		ok[s[0]] = 1;
		num[s[0]] = tnum(s[2]);
	}
} 
main(){
	while(cin >> s)dfs(s);
	for(ll i = 'A';i <= 'Z';i++)
		if(ok[i] && (num[i].num || num[i].yc)){
			if(num[i].yc)printf("%c=...%09lld\n",i,num[i].num);
			else printf("%c=%ld\n",i,num[i].num);
		}
	return 0;
}