# include <bits/stdc++.h>
using namespace std;
const int kl[4][4]={{1,1,1,0},{1,0,1,1},{1,1,0,1},{0,1,1,1}};
int T,n,m,ans[1010][1010];
int main() {
//    freopen("in.in","r",stdin);
//    freopen("out.out","w",stdout);

    scanf("%d",&T);
    
    while (T--) {
        scanf("%d%d",&n,&m);

        int x=0,y=0,tot=0,l=n%4,r=m%4;
        if (l==0||r==0) x=0, y=0, tot=n*m/4*3;
        else if (l==1&&r==1) x=3, y=3, tot=(n*m-1)/4*3+1;
        else if (l==1&&r==2) x=3, y=2, tot=(n*m-2)/4*3+2;
        else if (l==2&&r==1) x=2, y=3, tot=(n*m-2)/4*3+2;
        else if (l==1&&r==3) x=3, y=1, tot=(n*m-3)/4*3+3;
        else if (l==3&&r==1) x=1, y=3, tot=(n*m-3)/4*3+3;
        else if (l==2&&r==2) x=3, y=1, tot=(n*m-4)/4*3+4;
        else if (l==2&&r==3) x=2, y=1, tot=(n*m-6)/4*3+5;
        else if (l==3&&r==2) x=1, y=2, tot=(n*m-6)/4*3+5;
        else if (l==3&&r==3) x=1, y=1, tot=(n*m-9)/4*3+7;

        for (int i=1;i<=n;i++) for (int j=1;j<=m;j++) ans[i][j]=kl[(i-1+x)%4][(j-1+y)%4];

        printf("%d\n",tot);
        for (int i=1;i<=n;i++) {
            for (int j=1;j<=m;j++) printf("%d",ans[i][j]);
            printf("\n");
        }
    }

    return 0;
}