#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define op(x) ((x&1)?x+1:x-1)
#define odd(x) (x&1)
#define even(x) (!odd(x))
#define lc(x) (x<<1)
#define rc(x) (lc(x)|1)
#define lowbit(x) (x&-x)
#define mp(x,y) make_pair(x,y)
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
using namespace std;
const int MAXN = 1010;
int t,n,m,a[MAXN][MAXN];

namespace T{
	int a[MAXN][MAXN];
	void solve(int n,int m){
		assert(m>=4);

		if(n==3 && m%4==3){
			rep(i,1,n){
				for(int j=1;j<=m;j+=4){
					a[i][j] = a[i][j+1] = a[i][j+2] = a[i][j+3] = 1;
					if(i==1 || i==3)a[i][j+3] = 0;
					else a[i][j+2] = 0;
				}
			}

			return;
		}		

		rep(i,1,n){
			int j;
			for(j=1;j<=m;j+=4){
				a[i][j] = a[i][j+1] = a[i][j+2] = a[i][j+3] = 1;

				int x = i + (n%4==2);
				if(x%4 == 1)a[i][j+2] = 0;
				else if(x%4 == 2)a[i][j+1] = 0;
				else if(x%4 == 3)a[i][j+3] = 0;
				else a[i][j] = 0;
			}
		}
	}
};

void solve(){
	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(m>=4){
		T::solve(n,m);
		rep(i,1,n)rep(j,1,m)a[i][j] = T::a[i][j];
	}else{
		T::solve(m,n);
		rep(i,1,n)rep(j,1,m)a[i][j] = T::a[j][i];
	}
	int sum = 0;rep(i,1,n)rep(j,1,m)sum += a[i][j];
	cout<<sum<<"\n";
	rep(i,1,n){
		rep(j,1,m)cout<<a[i][j];
		cout<<"\n";
	}
}

int main(){
	ios::sync_with_stdio(false);cin.tie(0);

	cin>>t;
	while(t--)solve();

    return 0;
}