#include<bits/stdc++.h>
using namespace std;
const int N = 1010;
int a[4][4]={
    {1,1,1,0},
    {1,0,1,1},
    {1,1,0,1},
    {0,1,1,1}
};
int n, m;
int b[N][N], c[N][N], id[N][N];
int nxt[N];
int get(int x){return x==nxt[x]?x:nxt[x]=get(nxt[x]);}
int solve(int x,int y){
    int ans=0;
    for (int i=1;i<=n;++i){
        for (int j=1;j<=m;++j){
            b[i][j]=a[(i+x)%4][(j+y)%4];
            ans+=b[i][j];
        }
    }
    int idx=0;
    for (int i=1;i<=n;++i){
        for (int j=1;j<=m;++j) id[i][j]=++idx, nxt[idx]=idx;
    }
    for (int i=1;i<=n;++i){
        for (int j=1;j<=m;++j){
            if (b[i][j]){
                int cnt=0;
                if (i>1 && b[i-1][j]==1) nxt[get(id[i-1][j])]=get(id[i][j]);
                if (j>1 && b[i][j-1]==1) nxt[get(id[i][j-1])]=get(id[i][j]);
                if (i<n && b[i+1][j]==1) nxt[get(id[i+1][j])]=get(id[i][j]);
                if (j<m && b[i][j+1]==1) nxt[get(id[i][j+1])]=get(id[i][j]);
            }
        }
    }
    int cnt=0;
    for (int i=1;i<=n;++i){
        for (int j=1;j<=m;++j) cnt+=(b[i][j] && get(id[i][j])==id[i][j]);
    }
    if (cnt>1) ans=0;
    return ans;
}
void solve(){
    cin>>n>>m;
    if (n<=3 && m<=3){
        printf("%d\n",n*m);
        for (int i=1;i<=n;++i){
            for (int j=1;j<=m;++j) printf("%d",1); puts("");
        }
        return;
    }
    bool rev=0;
    if (n>m) swap(n,m),rev=1;
    int ans=0;
    if (n==3 && m%4==3){
        for (int i=1;i<=n;++i){
            for (int j=1;j<=m;++j){
                if (j<=3){
                    if (j==2 && i==2) b[i][j]=0;
                    else b[i][j]=1,ans++;
                }
                else if (i==1 || i==3){
                    if ((j-3)%4==1) b[i][j]=0;
                    else b[i][j]=1,ans++;
                }
                else{
                    if ((j-3)%4==3) b[i][j]=0;
                    else b[i][j]=1,ans++;
                }
            }
        }
        if (rev) swap(n,m);
        for (int i=1;i<=n;++i){
            for (int j=1;j<=m;++j) c[i][j]=(rev?b[j][i]:b[i][j]);
        }

    }
    else{
        if (rev) swap(n,m);
        for (int i=0;i<4;++i){
            for (int j=0;j<4;++j){
                int mx=solve(i,j);
                if (mx>ans){
                    ans=mx;
                    for (int k=1;k<=n;++k){
                        for (int l=1;l<=m;++l) c[k][l]=b[k][l];
                    }
                }
            }
        }
    }

    printf("%d\n",ans);
    for (int i=1;i<=n;++i){
        for (int j=1;j<=m;++j) printf("%d",c[i][j]);
        puts("");
    }
}
int main(){
//    for (int i=0;i<4;++i){
//        for (int j=0;j<4;++j) printf("%d ",a[i][j]); puts("");
//    }
    int t; cin>>t;
    while(t--) solve();

    return 0;
}