#include<bits/stdc++.h>

using i64=long long;
using u64=unsigned long long;

// #define ONLINE_JUDGE
#define INPUT_DATA_TYPE int
#define OUTPUT_DATA_TYPE int
inline __attribute((always_inline)) INPUT_DATA_TYPE read(){register INPUT_DATA_TYPE x=0;register char f=0,c=getchar();while(c<'0'||'9'<c)f=(c=='-'),c=getchar();while('0'<=c&&c<='9')x=(x<<3)+(x<<1)+(c&15),c=getchar();return f?-x:x;}void print(OUTPUT_DATA_TYPE x){if(x<0)x=-x,putchar('-');if(x>9)print(x/10);putchar(x%10^48);return;}

struct NODE{
    u64 len;
    int val;
};

u64 c[10];
std::map<std::vector<u64>,std::vector<NODE>> to[7];

int add(int val,int k,u64 len){
    int left=len%6;
    len-=left;
    while(left--)
        val=(val*10+k)%7;
    val=(val+(len/6)*11111*k)%7;
    return val;
}

bool dfs(std::vector<u64> vec,int val){
    int vv=val;
    std::vector<u64> vvec(vec);
    register int i=0;
    register u64 sum=0;
    for(i=0;i<7;++i) sum+=vec[i];
    if(!sum) return val==0;
    
    auto it=to[vv].find(vvec);
    if(it!=to[vv].end()) return !it->second.empty();

    std::vector<NODE> res;

    for(i=0;i<7;++i) if(vec[i]==sum){
        val=add(val,i,vec[i]);
        if(!val) res.push_back({vec[i],i});
        goto loop;
    }

    for(i=0;i<7;++i) if(vec[i]>5){
        res.push_back({vec[i]-5,i});
        val=add(val,i,vec[i]-5);
    }

    for(i=0;i<7;++i) if(vec[i]){
        vec[i]-=1;
        if(dfs(vec,(val*10+i)%7)==true){
            res.push_back({1ll,i});
            break;
        }
        vec[i]+=1;
    }
    if(i==8) i=-1;
    loop:;
    to[vv][vvec]=res;
    return !res.empty();
}

void solve(){
    register int i,val=0,vv;
    register u64 sum,min;
    for(i=0;i<10;++i) c[i]=read();
    for(i=7;i<10;++i) c[i%7]+=c[i];
    std::vector<u64> vec(c,c+7);
    if(!dfs(vec,0)) return puts("-1"),void();

    std::vector<NODE> res,tmp;
    sum=0;
    for(i=0;i<7;++i) sum+=vec[i];
    while(sum){
        vv=val;
        std::vector<u64> vvec(vec);
        for(auto [len,k]:to[vv][vvec]){
            res.push_back({len,k});
            vec[k]-=len;
            sum-=len;
            val=add(val,k,len);
        }
    }

    for(auto [len,k]:res){
        if(k<=2&&c[k+7]){
            if(len<=c[k+7]) c[k+7]-=len,tmp.push_back({len,k+7});
            else c[k+7]=0,tmp.push_back({c[k+7],k+7}),tmp.push_back({len-c[k+7],k});
        }else tmp.push_back({len,k});
    }

    printf("%d\n",tmp.size());
    for(auto [len,val]:tmp) printf("%lld %d\n",len,val);
}

int main(){
	#ifndef ONLINE_JUDGE
	freopen("name.in", "r", stdin);
	freopen("name.out", "w", stdout);
	#endif

    int T=read();
    while(T--) solve();

	#ifndef ONLINE_JUDGE
	fclose(stdin);
	fclose(stdout);
	#endif
    return 0;
}