#include<bits/stdc++.h>
#define int long long
#define ll long long
#define rep(i,s,t) for(int i=(s);i<=(t);i++)
#define rev_rep(i,s,t) for(int i=(s);i>=(t);i--)
using namespace std;
ll ci(){ ll x; scanf("%lld", &x); return x; }

enum{N = 1003};

int n, m;
int a[N][N];
int vis[N][N];
int tim_vis;


int dfs(int x,int y){
	int tot = 0;
	if( a[x][y] && vis[x][y]<tim_vis ) vis[x][y]=tim_vis, tot++;
	else return 0;
	if( x!=n ) tot += dfs(x+1, y);
	if( x!=1 ) tot += dfs(x-1, y);
	if( y!=m ) tot += dfs(x, y+1);
	if( y!=1 ) tot += dfs(x, y-1);
	return tot;
}
bool chk(int ans){
	rep(i,1,n) rep(j,1,m) if( a[i][j] ){
		tim_vis++;
		int cnt = dfs(i,j);
		//printf("line %d: ij %d %d cnt %lld\n", __LINE__, i,j,cnt);
		return cnt==ans;
	}
	return false;
}

const int tmp[] = {3,1,4,2};
int printk(int k){
	int ans = 0;
	rep(i,1,n){
		rep(j,1,m){
			a[i][j] = (tmp[(i+k)%4]+j)%4;
			if( a[i][j] ) ans++;
		}
	}
	return ans;
}

signed main(){
	int T = ci();
	while( T-- ){
		n = ci(), m = ci();
		if( n==3 && m==2 ){
			puts("6\n11\n11\n11");
			continue;
		}
		if( n==2 && m==3 ){
			puts("6\n111\n111");
			continue;
		}
		if( n==3 && m==3 ){
			puts("9\n111\n111\n111");
			continue;
		}
		int maxans = 0, maxk;
		rep(k,1,4){
			int ans = printk(k);
		//printf("line %d: ans %lld\n", __LINE__, ans);
		//rep(i,1,n){
		//	rep(j,1,m) printf("%d", a[i][j]);
		//	puts("");
		//}
			if( chk(ans) && maxans<ans ){
				maxans = ans;
				maxk = k;
			}
		}

		printf("%lld\n", maxans);
		//printf("line %d: ----------\n", __LINE__);
		printk(maxk);
		rep(i,1,n){
			rep(j,1,m) printf("%d", bool(a[i][j]));
			puts("");
		}
	}
	return 0;
}