//#pragma GCC optimize(3,"Ofast","inline")
//#pragma GCC optimize("-Ofast","-funroll-all-loops")
#include<bits/stdc++.h>
//#define getchar nc
#define sight(c) ('0'<=c&&c<='9')
#define swap(a,b) a^=b,b^=a,a^=b
#define LL long long
#define debug(a) cout<<#a<<" is "<<a<<"\n"
#define dput(a) puts("a")
#define eho(x) for(int i=head[x];i;i=net[i])
#define fi first
#define se second
inline char nc(){
static char buf[1000000],*p1=buf,*p2=buf;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,1000000,stdin),p1==p2)?EOF:*p1++;
}
template <class T>
inline void read(T &x){// unsigned
    static char c;
    for (c=getchar();!sight(c);c=getchar());
    for (x=0;sight(c);c=getchar())x=x*10+c-48;
}
template <class T> void write(T x){if (x<10) {putchar('0'+x); return;} write(x/10); putchar('0'+x%10);}
template <class T> inline void writeln(T x){ if (x<0) putchar('-'),x*=-1; write(x); putchar('\n'); }
template <class T> inline void writel(T x){ if (x<0) putchar('-'),x*=-1; write(x); putchar(' '); }
using namespace std;
int n,m,T;
int c[3][4]={{1,1,1,0},{1,0,1,1},{1,1,1,0}};
int e[4][4]={{1,1,1,0},{1,0,1,1},{1,1,0,1},{0,1,1,1}};
int ans[1007][1007];
signed main() {
	#ifdef LOCAL
	//	freopen("test.in", "r", stdin);
	//	freopen("test.out", "w", stdout);
	#endif
	scanf("%d",&T);
	while (T--) {
		scanf("%d%d",&n,&m);
		if (n<4&&m<4) {
			printf("%d\n",n*m);
			for (int i=0;i<n;i++,puts(""))
				for (int j=0;j<m;j++)
				 printf("%d",1);
		} else if (n==3&&m%4==3) {
			printf("%d\n",9*(m+1)/4-1);
			for (int i=0;i<3;i++,puts(""))
				for (int j=0;j<m;j++)
				 printf("%d",c[i][j%4]);
		} else if (n%3==0&&m==3) {
			printf("%d\n",9*(n+1)/4-1);
			for (int i=0;i<n;i++,puts(""))
				for (int j=0;j<3;j++)
				 printf("%d",c[j][i%4]);
		} else {
			int anw=0;
//			printf("%d\n",n*m-n*m/4-(n*m%4==0?0:1));
			int flag=((n%4==1)&&(m%4==1));
			for (int i=0;i<n;i++)
				for (int j=0;j<m;j++)
				  ans[i][j]=((i==n-1&&j==m-1&&flag)?0:e[i%4][j%4]),anw+=ans[i][j];
			printf("%d\n",anw);
			for (int i=0;i<n;i++,puts(""))
				for (int j=0;j<m;j++)
					printf("%d",ans[i][j]); 
		}
	} 
    return 0;
}
// CFIJM