#include<bits/stdc++.h>
using namespace std;
#define IOS {cin.tie(0);cout.tie(0);ios::sync_with_stdio(0);}
#define rep(i,j,k) for(int i=j;i<=k;++i)
#define per(i,j,k) for(int i=j;i>=k;--i)
#define P pair<int,int>
#define ll long long
#define vi vector<int>
vi f[100]; int cnt;
const int NM=1e6+6;
const P dir[]={{-1,0},{1,0},{0,1},{0,-1}};
int fa[NM];
int fd(int x){
    if(x==fa[x])return x;
    return fa[x]=fd(fa[x]);
}
void slv(){
    int n,m;cin>>n>>m;
    if(n<4 && m<4){
        cout<<n*m<<'\n';
        rep(i,1,n){
            rep(j,1,m)cout<<1; cout<<'\n';
        }
        return;
    }
    if(n==2 || m==2){
        vector<vi>res;
        int fl=0;
        if(m==2)fl=1,swap(n,m);
        res.resize(n+1);
        rep(i,1,n)res[i].resize(m+1);
        rep(j,1,m)res[1][j]=(j%4!=2);
        rep(j,1,m)res[2][j]=(j%4!=0);
        int num=0;
        rep(i,1,n)rep(j,1,m)num+=res[i][j];
        cout<<num<<'\n';
        if(fl){
            rep(j,1,m){
                rep(i,1,n)cout<<res[i][j]; cout<<'\n';
            }
        }
        else{
            rep(i,1,n){
                rep(j,1,m)cout<<res[i][j]; cout<<'\n';
            }
        }
        return;
    }
    vector<vi>res(n+1);
    rep(i,1,n)res[i].resize(m+1);
    auto inok=[&](int x,int y){
        return 1<=x && x<=n && 1<=y && y<=m;
    };
    auto cal=[&](int i,int j){
        return (i-1)*m+j;
    };
    auto ck=[&](int cnt){ //cnt个1
        rep(i,1,n*m)fa[i]=i;
        rep(i,1,n){
            rep(j,1,m){
                if(!res[i][j])continue;
                rep(k,0,3){
                    int ii=i+dir[k].first,jj=j+dir[k].second;
                    if(inok(ii,jj) && res[ii][jj]){
                        int u=cal(i,j),v=cal(ii,jj);
                        u=fd(u),v=fd(v);
                        if(u!=v)--cnt,fa[u]=v;
                    }
                }
            }
        }
        return cnt==1;
    };
    int mi=1e9,ans;
    rep(i,1,cnt){
        int num=0;
        rep(x,1,n){
            rep(y,1,m){
                if(f[i][(x-1)%4]%4==y%4)++num,res[x][y]=0;
                else res[x][y]=1;
            }
        }
        if(ck(n*m-num) && num<mi){
            mi=num; ans=i;
        }
    }
    cout<<n*m-mi<<'\n'; assert(mi<=n*m/4);
    rep(x,1,n){
        rep(y,1,m)cout<<int(f[ans][(x-1)%4]%4!=y%4);
        cout<<'\n';
    }
}
void ck(vi q){
    map<int,int>mp;
    for(auto i:q)mp[i]=1;
    if(mp.size()<4)return;
    mp.clear();
    rep(i,0,3)mp[(i+q[i])%4]=1;
    if(mp.size()==1)return;
    mp.clear();
    rep(i,0,3)mp[(i-q[i]+4)%4]=1;
    if(mp.size()==1)return;
    f[++cnt]=q; 
}
signed main(){
    // IOS
    rep(i1,1,4){
        rep(i2,1,4){
            rep(i3,1,4){
                rep(i4,1,4){
                    ck(vector<int>({i1,i2,i3,i4}));
                }
            }
        }
    }
    // rep(i,1,cnt){
    //     for(auto v:f[i])cout<<v<<' '; cout<<'\n';
    // }
    // return 0;
    int T;cin>>T;
    while(T--)slv();
}