#include <cstdio>
#include <string>

using namespace std;

int fromroman(string s) {
	if (s[0]=='O') return 0;
	int pom=0;
	int suc=0;
	for (int i=0;i<s.size();i++) {
		switch (s[i]) {
			case 'I' : pom=1; suc+=1; break;
			case 'V' : if (pom==0) { pom=5; suc+=5; break; } 
					if (pom<5) {suc-=2*pom; suc+=5; pom=0; break;}
					pom=5;
					suc+=5;  break;
			case 'X' : if (pom==0) { pom=10; suc+=10; break; } 
					if (pom<10) {suc-=2*pom; suc+=10; pom=0; break;}
					pom=10;
					suc+=10;  break;
			case 'L' : if (pom==0) { pom=50; suc+=50; break; } 
					if (pom<50) {suc-=2*pom; suc+=50; pom=0; break;}
					pom=50;
					suc+=50;  break;
			case 'C' : if (pom==0) { pom=100; suc+=100; break; } 
					if (pom<100) {suc-=2*pom; suc+=100; pom=0; break;}
					pom=100;
					suc+=100;  break;
			case 'D' : if (pom==0) { pom=500; suc+=500; break; } 
					if (pom<500) {suc-=2*pom; suc+=500; pom=0; break;}
					pom=500;
					suc+=500;  break;
			case 'M' : if (pom==0) { pom=1000; suc+=1000; break; } 
					if (pom<1000) {suc-=2*pom; suc+=1000; pom=0; break;}
					pom=1000;
					suc+=1000;  break;

		}
	}
	return suc;

}

string toroman(int x) {
	if (x==0) return "O";
	string ts="";
	if (x/1000!=0) {
		for (int i=0;i<x/1000;i++) ts+='M';
	}
	x%=1000;

	switch (x/100) {
		case 1 : ts+='C'; break;
		case 2 : ts+="CC"; break;
		case 3 : ts+="CCC"; break;
		case 4 : ts+="CD"; break;
		case 5 : ts+="D"; break;
		case 6 : ts+="DC"; break;
		case 7 : ts+="DCC"; break;
		case 8 : ts+="DCCC"; break;
		case 9 : ts+="CM"; break;
	}
	x%=100;
	switch (x/10) {
		case 1 : ts+='X'; break;
		case 2 : ts+="XX"; break;
		case 3 : ts+="XXX"; break;
		case 4 : ts+="XL"; break;
		case 5 : ts+="L"; break;
		case 6 : ts+="LX"; break;
		case 7 : ts+="LXX"; break;
		case 8 : ts+="LXXX"; break;
		case 9 : ts+="XC"; break;
	}
	x%=10;

	switch (x) {
		case 1 : ts+='I'; break;
		case 2 : ts+="II"; break;
		case 3 : ts+="III"; break;
		case 4 : ts+="IV"; break;
		case 5 : ts+="V"; break;
		case 6 : ts+="VI"; break;
		case 7 : ts+="VII"; break;
		case 8 : ts+="VIII"; break;
		case 9 : ts+="IX"; break;
	}

	return ts;
}

int regs[10];
bool bregs[10];

void res() {
	for (int i=0;i<10;i++) {
		regs[i]=0;
		bregs[i]=false;
	}
}

int main() {
	char sch[10001];
	res();
	while (1) {
		fgets(sch,10001,stdin);
		string ss=sch;

		if (ss[0]=='R') { 
			res();
			printf("Ready\n");
			continue;
		}
		if (ss[0]=='Q') {
			printf("Bye\n");
			return 0;
		}

		int toreg=ss[0]-'0';
		for (int i=2;i<ss.size();i++) {
			if ((ss[i]-'0')>0 && (ss[i]-'0')<10) if (!bregs[ss[i]-'0']) {
				printf("Error\n");
				continue;
			}
		}

		int temp=0;
		string stmp="";
		bool plus=true;
		for (int i=2;ss[i]!='\n';i++) {
			if ((ss[i]-'0')>0 && (ss[i]-'0')<10) {
				if (plus) {
					temp+=regs[ss[i]-'0'];	
				}
				else temp-=regs[ss[i]-'0'];	
				continue;
			}
			if (ss[i]=='+') {
				if (stmp!="") {
					if (plus) {
						temp+=fromroman(stmp);
					} else temp-=fromroman(stmp);
				}
				plus=true;
				stmp="";
				continue;
			}
			if (ss[i]=='-') {
				if (stmp!="") {
					if (plus) {
						temp+=fromroman(stmp);
					} else temp-=fromroman(stmp);
				}
				plus=false;		
				stmp="";
				continue;
			}
			stmp+=ss[i];
		}
		if (stmp!="") {
			if (plus) {
				temp+=fromroman(stmp);
			} else temp-=fromroman(stmp);
		}
			
		if (temp<0 || temp>10000) {
			printf("Error\n");
			continue;
		}

		regs[toreg]=temp;
		bregs[toreg]=true;
		printf("%d=%s\n",toreg,toroman(regs[toreg]).c_str());
	
	}


	return 0;
}