#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=1e3+5,M=N*40+5,K=(1<<25)+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const ll INF=1e18+7;mt19937 rnd(time(0));
int n,m,A[N][N],B[N][N],ans;
void print(){
	int tot=0;
	for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) tot+=A[i][j];
	printf("%d\n",tot);
	for(int i=1;i<=n;i++) {
		for(int j=1;j<=m;j++) printf("%d",A[i][j]);printf("\n");
	}
}
int fa[N*N];
int GI(int x,int y){return (x-1)*m+y;}
int GF(int x){return fa[x]^x?fa[x]=GF(fa[x]):x;}
void CK(){
	int i,j;
	for(int i=1;i<=n;i++) for(int j=1;j<=m;j++){
		if(i>4) B[i][j]=B[i-4][j];
		else if(j>4) B[i][j]=B[i][j-4];
	}
	iota(fa+1,fa+n*m+1,1);
	for(i=1;i<=n;i++) for(j=1;j<m;j++) if(B[i][j]&&B[i][j+1]&&GF(GI(i,j))^GF(GI(i,j+1))) fa[GF(GI(i,j))]=GF(GI(i,j+1));
	for(i=1;i<n;i++) for(j=1;j<=m;j++) if(B[i][j]&&B[i+1][j]&&GF(GI(i,j))^GF(GI(i+1,j))) fa[GF(GI(i,j))]=GF(GI(i+1,j));
	int Rt=0;
	for(i=1;i<=n;i++) for(j=1;j<=m;j++) if(B[i][j]){
		if(!Rt) Rt=GF(GI(i,j));
		else if(Rt^GF(GI(i,j))) return;
	}
	int tot=0;
	for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) tot+=B[i][j];
	if(tot>ans) {
		ans=tot;
		for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) A[i][j]=B[i][j];
	}
}
void Solve(){
	int i,j;scanf("%d%d",&n,&m);
	if(n<4&&m<4){
		printf("%d\n",n*m);
		for(i=1;i<=n;i++){
			for(j=1;j<=m;j++) Pc('1');printf("\n");
		}
		return;
	}
	if(n<4){
		for(i=1;i<=n;i++){
			for(j=1;j<=m;j++) {
				if(i&1){
					A[i][j]=(j%4!=0);
				}else {
					A[i][j]=(j%4!=2);
				}
			}
		}
		print();return ;
	}
	if(m<4){
		for(i=1;i<=n;i++){
			for(j=1;j<=m;j++) {
				if(j&1){
					A[i][j]=(i%4!=0);
				}else {
					A[i][j]=(i%4!=2);
				}
			}
		}
		print();return;
	}
	ans=0;
	int C[5]={0,1,2,3,4};
	do{
		Me(B,0);
		for(int i=1;i<=4;i++) for(int j=1;j<=4;j++) B[i][j]=(j!=C[i]);
		CK();
	}while(next_permutation(C+1,C+5));
	print();
}
int main(){
	int t;
	scanf("%d",&t);
	// t=1;
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}