#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e18
#define mod 998244353
#define int ll
#define N 1005
using namespace std;
int n,m;
int vis[N][N],a[N][N],A[N][N];
const int b[4][4]={
	{1,1,1,0},
	{1,0,1,1},
	{1,1,0,1},
	{0,1,1,1}};
const int dx[4]={0,0,1,-1};
const int dy[4]={1,-1,0,0};
bool chk()
{
	int x=0;
	for (int i=0;i<n;i++)
		for (int j=0;j<m;j++) vis[i][j]=0;
	for (int i=0;i<n;i++)
		for (int j=0;j<m;j++)
			if (a[i][j]&&!vis[i][j])
			{
				x++;
				if (x>1)return 0;
				queue<pa>q;
				q.push(mp(i,j));
				while (!q.empty())
				{
					int X=q.front().fi,Y=q.front().se;
					vis[X][Y]=1;
					q.pop();
					for (int k=0;k<4;k++)
					{
						int nx=X+dx[k];
						int ny=Y+dy[k];
						if (nx>=0&&nx<n&&ny>=0&&ny<m&&a[nx][ny])
						{
							if (vis[nx][ny]) continue;
							vis[nx][ny]=1;
							q.push(mp(nx,ny));
						}
					}
				}
			}
	return 1;
}
void BellaKira()
{
	cin>>n>>m;
	if (n<=3&&m<=3)
	{
		cout<<n*m<<'\n';
		for (int i=1;i<=n;i++)
		{
			for (int j=1;j<=m;j++) cout<<1;
			cout<<'\n';
		}
		return;
	}
	if (n<=2)
	{
		for (int i=1;i<=n;i++)
		{
			for (int j=0;j<m;j++)
				cout<<((j%4)!=(4-i));
			cout<<'\n';
		}
		return;
	}
	if (m<=2)
	{
		for (int i=0;i<n;i++)
		{
			for (int j=0;j<m;j++)
				cout<<((i%4)!=(4-j));
			cout<<'\n';
		}
		return;
	}
	int ans=0;
	for (int x=0;x<4;x++)
		for (int y=0;y<4;y++)
		{
			int tot=0;
			for (int i=0;i<n;i++)
				for (int j=0;j<m;j++)
					a[i][j]=b[(x+i)%4][(y+j)%4],tot+=a[i][j];
			// cout<<"?"<<tot<<'\n';
			if (tot>ans&&chk())
			{
				ans=tot;
				for (int i=0;i<n;i++)
					for (int j=0;j<m;j++)
						A[i][j]=a[i][j];
			}
		}
	cout<<ans<<'\n';
	for (int i=0;i<n;i++)
	{
		for (int j=0;j<m;j++) cout<<A[i][j];
		cout<<'\n';
	}
}
signed main()
{
	IOS;
	cin.tie(0);
	int T=1;
	cin>>T;
	while (T--)
	{
		BellaKira();
	}
}