#include<cstdio>#include<cstdlib>#include<cstring>#include<string>#include<iostream>#include<sstream>#include<algorithm>#include<cmath>#include<vector>#include<stack>#include<queue>#include<deque>#include<bitset>#include<set>#include<map>#include<unordered_set>#include<unordered_map>#defineLLlonglong#definemem(a, b)memset(a, b,sizeof a)#definelowbit(x)(-x&x)#defineIOSios::sync_with_stdio(false),cin.tie(nullptr)#defineendl'\n'usingnamespace std;int n;
vector<int>add(vector<int>&A, vector<int>&B){
vector<int> C;int la = A.size(), lb = B.size();for(int i =0, t =0; i < la || i < lb || t >0; i ++){
t +=(i < la ? A[i]:0)+(i < lb ? B[i]:0);
C.push_back(t %10);
t /=10;}return C;}intmain(){
IOS;
cin >> n;for(int C =1; C <= n; C ++){
string a, b;
cin >> a >> b;
vector<int> A, B;for(int i = a.size()-1; i >=0; i --) A.push_back(a[i]-'0');for(int i = b.size()-1; i >=0; i --) B.push_back(b[i]-'0');
cout <<"Case "<< C <<":"<< endl;
cout << a <<" + "<< b <<" = ";
A =add(A, B);reverse(A.begin(), A.end());for(int i =0; i < A.size(); i ++) cout << A[i];
cout <<(C == n ?"\n":"\n\n");}return0;}