#include<bits/stdc++.h>

 using namespace std;

 typedef long long ll;

 typedef unsigned int uint;

 typedef unsigned long long ull;

 typedef pair<int,int> PII;

 typedef pair<ll,ll> Pll;

 typedef vector<int> VI;

 typedef vector<PII> VII;

 #define N  1100000

 #define M  4100000

 #define fi first

 #define se second

 #define MP make_pair

 #define pi acos(-1)

 #define mem(a,b) memset(a,b,sizeof(a))

 #define rep(i,a,b) for(int i=(int)a;i<=(int)b;i++)

 #define per(i,a,b) for(int i=(int)a;i>=(int)b;i--)

 #define lowbit(x) x&(-x)

 #define Rand (rand()*(1<<16)+rand())

 #define id(x) ((x)<=B?(x):m-n/(x)+1)

 #define ls p<<1

 #define rs p<<1|1

 const ll MOD=1e9+,inv2=(MOD+)/;

       double eps=1e-;

       int INF=1e9;

 char a[N],b[N],c[N];

 int A[N],B[N],C[N],t[N],flag,la,lb,lc;

 int read()

 {

    int v=,f=;

    char c=getchar();

    while(c<||<c) {if(c=='-') f=-; c=getchar();}

    while(<=c&&c<=) v=(v<<)+v+v+c-,c=getchar();

    return v*f;

 }

 void solve1()

 {

     int na=,nc=;

     rep(i,,1e6+) A[i]=B[i]=C[i]=t[i]=;

     rep(i,,1e6-la) A[++na]=;

     per(i,la,) A[++na]=a[i]-'';

     rep(i,,1e6-lc) C[++nc]=;

     per(i,lc,) C[++nc]=c[i]-'';

     int p=;

     per(i,1e6,)

     {

         if(C[i]>A[i]) break;

         if(C[i]<A[i]){p=; break;}

     }

     if(!p) return;

     rep(i,,1e6)

     {

         t[i]=t[i]+C[i]-A[i];

         if(t[i]<)

         {

             t[i+]--;

             t[i]+=;

         }

     }

     p=;

     int k=1e6;

     while(k>&&t[k]==) k--;

     per(i,k/,) swap(t[i],t[k-i+]);

     rep(i,,lb)

      if((b[i]-'')!=t[i]){p=; break;}

     if(p)

     {

         flag=;

         printf("%d %d %d\n",-la,k-lb,-lc);

     }

 }

 void solve2()

 {

     if(flag) return;

     rep(i,,1e6+) A[i]=B[i]=C[i]=t[i]=;

     int nb=,nc=;

     rep(i,,1e6-lb) B[++nb]=;

     per(i,lb,) B[++nb]=b[i]-'';

     rep(i,,1e6-lc) C[++nc]=;

     per(i,lc,) C[++nc]=c[i]-'';

     int p=;

     per(i,1e6,)

     {

         if(C[i]>B[i]) break;

         if(C[i]<B[i]){p=; break;}

     }

     if(!p) return;

     rep(i,,1e6)

     {

         t[i]=t[i]+C[i]-B[i];

         if(t[i]<)

         {

             t[i+]--;

             t[i]+=;

         }

     }

     p=;

     int k=1e6;

     while(k>&&t[k]==) k--;

     per(i,k/,) swap(t[i],t[k-i+]);

     rep(i,,la)

      if((a[i]-'')!=t[i]){p=; break;}

     if(p)

     {

         flag=;

         printf("%d %d %d\n",k-la,-lb,-lc);

     }

 }

 void solve3()

 {

     if(flag) return;

     rep(i,,1e6+) A[i]=B[i]=C[i]=t[i]=;

     int na=,nb=,nc=;

     rep(i,,1e6--la) A[++na]=;

     per(i,la,) A[++na]=a[i]-'';

     rep(i,,1e6--lb) B[++nb]=;

     per(i,lb,) B[++nb]=b[i]-'';

     rep(i,,1e6-lc) C[++nc]=;

     per(i,lc,) C[++nc]=c[i]-'';

     rep(i,,1e6)

     {

         t[i]=t[i]+A[i]+B[i];

         if(t[i]>)

         {

             t[i]-=;

             t[i+]++;

         }

     }

     int p=;

     rep(i,,1e6+)

      if(t[i]!=c[i]){p=; break;}

     if(p)

     {

         flag=;

         printf("%d %d %d\n",--la,--lb,-lc);

     }

 }

 int main()

 {

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

     int cas;

     scanf("%d",&cas);

     while(cas--)

     {

         scanf("%s",a+);

         scanf("%s",b+);

         scanf("%s",c+);

         la=strlen(a+),lb=strlen(b+),lc=strlen(c+);

         //printf("la=%d lb=%d lc=%d\n",la,lb,lc);

         flag=;

         solve1();

         solve2();

         solve3();

         if(!flag) printf("-1\n");

     }

     return ;

 }