#include<bits/stdc++.h>
#define rep(i,a,b) for (int i = (a); i <= (b); ++i)
#define drep(i,a,b) for (int i = (a); i >= (b); --i)
#define LL long long
#define pii pair<int,int>
#define pll pair<LL,LL>
#define fi first
#define se second
#define mp make_pair
#define vi vector<int>
#define eb emplace_back
#define all(v) v.begin(),v.end()
#define sz(v) ((int)v.size())
using namespace std;
LL read() {
	LL x = 0,y = 1; char ch = getchar(); while (!isdigit(ch)) {if (ch == '-') y = -y; ch = getchar();}
	while (isdigit(ch)) {x = x*10+ch-'0'; ch = getchar();} return x*y;
}
const int tst = 0,rd = 1; int getflg = 0;
namespace qiqi {
	const int N = 1e3+5; int n,m,cnt,id[N][N],a[N][N];
	struct DSU {
		vi fa; void init(int n) {fa.assign(n+1,0); iota(all(fa),0);}
		int find(int x) {return x == fa[x] ? x : fa[x] = find(fa[x]);}
		void merge(int x,int y) {
			x = find(x); y = find(y);
			if (x == y) return;
			fa[y] = x;
		}
	} dsu;
	bool valid(int x,int y) {return x >= 1 && x <= n && y >= 1 && y <= m;}
	pair<int,vi> dfs0(vi& p) {
		pair<int,vi> ans = mp(0,vi());
		if (sz(p) == 4) {
			int cnt = 0,flg = 1,fir = 0;
			rep(i,1,n) rep(j,1,m) {
				cnt += a[i][j] = p[i%4] != j%4;
			}
			dsu.init(n*m);
			rep(i,1,n) rep(j,1,m) if (a[i][j]) {
				if (valid(i+1,j) && a[i+1][j]) dsu.merge(id[i][j],id[i+1][j]);
				if (valid(i,j+1) && a[i][j+1]) dsu.merge(id[i][j],id[i][j+1]);
			}
			rep(i,1,n) rep(j,1,m) {
				if (valid(i+3,j)) flg &= !(a[i][j] == a[i+1][j] && a[i][j] == a[i+2][j] && a[i][j] == a[i+3][j]);
				if (valid(i,j+3)) flg &= !(a[i][j] == a[i][j+1] && a[i][j] == a[i][j+2] && a[i][j] == a[i][j+3]);
			}
			rep(i,1,n) rep(j,1,m) if (a[i][j]) {
				if (!fir) fir = dsu.find(id[i][j]);
				else flg &= fir == dsu.find(id[i][j]);
			}
			if (flg) ans = mp(cnt,p);
		}
		else {
			rep(i,0,3) {
				p.eb(i);
				ans = max(ans,dfs0(p));
				p.pop_back();
			}
		}
		return ans;
	}
	pair<int,vi> dfs1(vi& p) {
		pair<int,vi> ans = mp(0,vi());
		if (sz(p) == 4) {
			int cnt = 0,flg = 1,fir = 0;
			rep(i,1,n) rep(j,1,m) {
				cnt += a[i][j] = p[j%4] != i%4;
			}
			dsu.init(n*m);
			rep(i,1,n) rep(j,1,m) if (a[i][j]) {
				if (valid(i+1,j) && a[i+1][j]) dsu.merge(id[i][j],id[i+1][j]);
				if (valid(i,j+1) && a[i][j+1]) dsu.merge(id[i][j],id[i][j+1]);
			}
			rep(i,1,n) rep(j,1,m) {
				if (valid(i+3,j)) flg &= !(a[i][j] == a[i+1][j] && a[i][j] == a[i+2][j] && a[i][j] == a[i+3][j]);
				if (valid(i,j+3)) flg &= !(a[i][j] == a[i][j+1] && a[i][j] == a[i][j+2] && a[i][j] == a[i][j+3]);
			}
			rep(i,1,n) rep(j,1,m) if (a[i][j]) {
				if (!fir) fir = dsu.find(id[i][j]);
				else flg &= fir == dsu.find(id[i][j]);
			}
			if (flg) ans = mp(cnt,p);
		}
		else {
			rep(i,0,3) {
				p.eb(i);
				ans = max(ans,dfs1(p));
				p.pop_back();
			}
		}
		return ans;
	}
	void main() {
		n = read(); m = read(); cnt = 0;
		rep(i,1,n) rep(j,1,m) id[i][j] = ++cnt;
		vi p; pair<int,vi> ans0 = dfs0(p),ans1 = dfs1(p);
		if (ans0.fi > ans1.fi) {
			printf("%d\n",ans0.fi);
			rep(i,1,n) {
				rep(j,1,m) {
					printf("%d",ans0.se[i%4] != j%4);
				}
				puts("");
			}
		}
		else {
			printf("%d\n",ans1.fi);
			rep(i,1,n) {
				rep(j,1,m) {
					printf("%d",ans1.se[j%4] != i%4);
				}
				puts("");
			}
		}
	}
}
int main() {
	int T = read(); while (T--) qiqi::main(); return 0;
}