#include <cstdio>

 #include <cstring>

 using namespace std;

 const int maxn =  + ;

 int  t, Case = , now;

 int ans[maxn];

 char s1[maxn], s2[maxn];

 int main () {

     scanf("%d", &t);

     while(t --) {

         if(Case > ) printf("\n");

         now = ;

         memset(ans, , sizeof(ans));

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

         int len1 = strlen(s1), len2 = strlen(s2), i = len1 - , j = len2 - ;

         while(i >=  && j >= ) {

             ans[now + ] =  (ans[now] + s1[i] + s2[j] -  * '') / ;

             ans[now] = (ans[now ++] + s1[i --] + s2[j --] -  * '') % ;

         }

         while(i >= ) {

             ans[now + ] = (ans[now] + s1[i] - '') / ;

             ans[now] = (ans[now ++] + s1[i --] - '') % ;

         }

         while(j >= ) {

             ans[now + ] = (ans[now] + s2[j] - '') / ;

             ans[now] = (ans[now ++] + s2[j --] - '') % ;

         }

         printf("Case %d:\n%s + %s = ", ++ Case, s1, s2);

         if(ans[now] > )    now ++;

         for(i = now - ; i >= ; i --)

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

         printf("\n");

     }

     return ;

 }