#include <stdio.h>

 #include <string.h>

 #include <stdlib.h>

 #include <math.h>

 #include <assert.h>

 #include <ctype.h>

 #include <map>

 #include <string>

 #include <set>

 #include <bitset>

 #include <utility>

 #include <algorithm>

 #include <vector>

 #include <stack>

 #include <queue>

 #include <iostream>

 #include <fstream>

 #include <list>

 using  namespace  std;

 const  int MAXL = ;

 struct  BigNum

 {

     int  num[MAXL];

     int  len;

     BigNum()

     {

         memset(num,,sizeof(num));

     }

 };

 //高精度加法

 BigNum  Add(BigNum &a, BigNum &b)

 {

     BigNum c;

     int  i, len;

     len = (a.len > b.len) ? a.len : b.len;

     memset(c.num, , sizeof(c.num));

     for(i = ; i < len; i++)

     {

         c.num[i] += (a.num[i]+b.num[i]);

         if(c.num[i] >= )

         {

             c.num[i+]++;

             c.num[i] -= ;

         }

     }

     if(c.num[len])

         len++;

     c.len = len;

     return  c;

 }

 void  print(BigNum &a)   //输出大数

 {

     int  i;

     for(i = a.len-; i >= ; i--)

         printf("%d", a.num[i]);

     printf("\n");

 }

 void Init(BigNum &a, char *s, int &tag)   //将字符串转化为大数

 {

     int  i = , j = strlen(s);

     if(s[] == '-')

     {

         j--;

         i++;

         tag *= -;

     }

     a.len = j;

     for(; s[i] != '\0'; i++, j--)

         a.num[j-] = s[i]-'';

 }

 int main(void)

 {

     //freopen("in.txt","r",stdin);

     int T;

     char  s1[MAXL], s2[MAXL];

     scanf("%d",&T);

     for(int t=;t<=T;t++)

     {

         BigNum a,b,c;

         memset(s1,,sizeof(s1));

         memset(s2,,sizeof(s2));

         scanf("%s %s",s1,s2);

         int tag=;

         Init(a,s1,tag);

         Init(b,s2,tag);

         c=Add(a,b);

         if(t!=)

         printf("\n");

         printf("Case %d:\n",t);

         printf("%s + %s = ",s1,s2);

         print(c);

     }

     return ;

 }

 #include<iostream>

 #include<string.h>

 #include<math.h>

 #include<stdlib.h>

 #include<stdio.h>

 using namespace std;

 const int M=;

 void xsone(int a[],int b[],int lenz)

 {

     for(int i=;i<lenz;i++)

     a[i]=a[i]+b[i];

     int temp=;

     for(int i=;i<lenz+;i++)

     {

         a[i]+=temp;

         temp=a[i]/;

         a[i]%=;

     }

     int i;

     for(i=lenz+;i>=;i--)

     if(a[i]!=)

     break;

     for(;i>=;i--)

     printf("%d",a[i]);

     printf("\n");

 }

 int main()

 {

     //freopen("in.txt","r",stdin);

     int n;

     scanf("%d",&n);

     for(int i=;i<=n;i++)

     {

         char sa[M],sb[M];

         memset(sa,,sizeof(sa));

         memset(sb,,sizeof(sb));

         scanf("%s %s",sa,sb);

         int lena = strlen(sa);

         int lenb = strlen(sb);

         int lenz = lena>lenb ?lena :lenb;

         int a[M],b[M];

         memset(a,,sizeof(a));

         memset(b,,sizeof(b));

         int j;

         for(j=;j<lena;j++)

         a[lena--j]=sa[j]-'';

         for(j=;j<lenb;j++)

         b[lenb--j]=sb[j]-'';

         printf("Case %d:\n",i);

         printf("%s + %s = ",sa,sb);

         xsone(a,b,lenz);

         if(i!=n)

         printf("\n");

     }

     return ;

 }