#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];
void Solve(){
	int i,j;scanf("%d%d",&n,&m);
	for(i=1;i<=m;i++) if(i%4==0) A[1][i]=0;else A[1][i]=1;
	for(i=1;i<=m;i++) if(i%4==2) A[2][i]=0;else A[2][i]=1;
	for(i=1;i<=m;i++) if(i%4==1) A[3][i]=0;else A[3][i]=1;
	for(i=1;i<=m;i++) if(A[1][i]&&A[2][i]&&A[3][i]) A[4][i]=0;else A[4][i]=1;
	for(i=5;i<=n;i++) {
		for(j=1;j<=m;j++) A[i][j]=A[i-4][j];
	}
	int tot=0;
	for(i=1;i<=n;i++) for(j=1;j<=m;j++) tot+=A[i][j];
	printf("%d\n",tot);
	for(i=1;i<=n;i++) {
		for(j=1;j<=m;j++) printf("%d",A[i][j]);printf("\n");
	}
}
int main(){
	int t;
	scanf("%d",&t);
	// t=1;
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}