#include<bits/stdc++.h>
using namespace std;
const int N=1e6+100;
vector<int>G[N];
const int A[4][4]=
{
    {1,1,1,0},
    {1,0,1,1},
    {1,1,0,1},
    {0,1,1,1}
};
void solve(int n,int m)
{
    // cerr<<"SOLVE : "<<n<<","<<m<<endl;
    if(n==1)
    {
        cout<<min(m,3)<<"\n";
        for(int i=1;i<=3&&i<=m;++i)cout<<"1";
        for(int i=4;i<=m;++i)cout<<"0";
        cout<<"\n";
        return;
    }
    if(m==1)
    {
        cout<<min(n,3)<<"\n";
        for(int i=1;i<=3&&i<=n;++i)cout<<"1\n";
        for(int i=4;i<=n;++i)cout<<"0\n";
        return;
    }
    if(n<=3&&m<=3)
    {
        cout<<n*m<<"\n";
        for(int i=1;i<=n;++i,cout<<"\n")
            for(int j=1;j<=m;++j)
                cout<<"1";
        return;
    }
    for(int i=0;i<n+10;++i)
        G[i].resize(m+10);
    for(int i=0;i<n+1;i+=4)
        for(int j=0;j<m+1;j+=4)
            for(int x=0;x<4;++x)
                for(int y=0;y<4;++y)
                    G[i+x][j+y]=A[x][y];
    int dx=0,dy=0;
    if(n%4==1)++dy;
    else if(m%4==1)++dx;
    int cnt=0;
    for(int i=0;i<n;++i)
        for(int j=0;j<m;++j)
            cnt+=G[i+dx][j+dy];
    cout<<cnt<<"\n";
    for(int i=0;i<n;++i,cout<<"\n")
        for(int j=0;j<m;++j)
            cout<<G[i+dx][j+dy];
    for(int i=0;i<n+10;++i)G[i].clear();
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr),cout.tie(nullptr);
    int T;
    cin>>T;
    while(T--)
    {
        int n,m;
        cin>>n>>m;
        solve(n,m);
    }

}