#include<bits/stdc++.h>
#define rep(i,s,n) for (int i = (int)(s); i < (int)(n); i++)
#define all(v) begin(v),end(v)
using namespace std;
using ll = long long;
using vl=vector<ll>;
using vvl=vector<vl>;
using pll=pair<ll,ll>;
using vp=vector<pll>;
using vvp=vector<vp>;
using vs=vector<string>;
bool chmin(auto &a, auto b){ return a > b ? a = b, 1 : 0; }
bool chmax(auto &a, auto b){ return a < b ? a = b, 1 : 0; }
const ll INF=1LL<<60;

void solve(ll h,ll w){
    auto output=[](vs rs){
        ll t=0;
        for(auto s:rs)for(auto c:s)if(c=='1') t++;
        cout<<t<<endl;
        for(auto s:rs) cout<<s<<endl;
    };
    if(h<4&&w<4){
        output(vs(h,string(w,'1')));
        return;
    }
    bool is_swap=false;
    if(h>w){
        is_swap=true;
        swap(h,w);
    }
    vs rs(h,string(w,'1'));
    if(h==2){
        rep(j,0,w)if(j%4==3) rs[0][j]='0';
        rep(j,0,w)if(j%4==1) rs[1][j]='0';
    }
    else if(h%4==0||w%4==0){
        vs a={
            "1011",
            "1110",
            "0111",
            "1101"
        };
        rep(i,0,h)rep(j,0,w) rs[i][j]=a[i%4][j%4];
    }
    else{
        vs a={
            "1110",
            "1101",
            "0111",
            "1011"
        };
        rep(i,0,h)rep(j,0,w) rs[i][j]=a[i%4][j%4];
    }
    if(is_swap){
        vs rs_(w,string(h,'0'));
        rep(i,0,h)rep(j,0,w) rs_[j][i]=rs[i][j];
        rs=rs_;
    }
    output(rs);
}

int main(){
    cin.tie(0)->sync_with_stdio(0);

    ll q;
    cin>>q;
    while(q--){
        ll h,w;
        cin>>h>>w;
        solve(h,w);
    }
}