#include <iostream>
#include <algorithm>
using namespace std;
signed main() {
	int t;
	cin >> t;
	int ans = 0;
	while (t--) {
		string a, b;
		cin >> a >> b;
		int aa[10005] = {0};
		int bb[10005] = {0};
		int cc[10005] = {0};
		int len1 = a.length();
		int len2 = b.length();
		int mx = max(len1, len2);
		for (int i = 0; i < len1; i++) {
			aa[i] = a[len1 - 1 - i] - '0';
		}
		for (int i = 0; i < len2; i++) {
			bb[i] = b[len2 - 1 - i] - '0';
		}
		int ss = 0;
		for (int i = 0; i < mx; i++) {
			cc[i] = aa[i] + bb[i] + ss;
			ss = cc[i] / 10;
			cc[i] %= 10;
		}
		if (ss != 0) {
			cc[mx] = ss;
			mx++;
		}
		cout << "Case " << ++ans << ":" << '\n';
		cout << a << " + " << b << " = ";
		for (int i = mx - 1; i >= 0; i--) {
			cout << cc[i];
		}
		cout << '\n';
	}
	return 0;
}