/*
可以发现按照如下方式循环构造，记得考虑特殊情况造成的不连通
111011101110
101110111011
110111011101
011101110111
111011101110
101110111011
110111011101
011101110111
...
在这n+4行中选出最优的n行即为答案，注意特判n<=3，m<=3的情况
n=3,n<m
1110
1011
1110
*/
#include<bits/stdc++.h>
using namespace std;
int n, m;
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int T;
	cin >> T;
	while (T--) {
		cin >> n >> m;
		if (n <= 3 && m <= 3) {
			cout << n * m << "\n";
			for (int i = 0; i < n; i++) {
				for (int j = 0; j < m; j++) {
					cout << 1;
				}
				cout << "\n";
			}
			continue;
		}
		else if (n == 2) {
			if (m % 4 <= 1) cout << (m/4) * 6 + 2 * (m%4) << "\n";
			else cout << (m/4) * 6 + 2 * (m%4) - 1 << "\n";
			for (int i = 0; i < m; i++) cout << (i%4==3?0:1); cout << "\n";
			for (int i = 0; i < m; i++) cout << (i%4==1?0:1); cout << "\n";
			continue;
		}
		else if (n == 3) {
			if (m % 4 <= 1) cout << (m/4) * 9 + 3 * (m%4) << "\n";
			else cout << (m/4) * 9 + 3 * (m%4) - 1 << "\n";
			for (int i = 0; i < m; i++) cout << (i%4==3?0:1); cout << "\n";
			for (int i = 0; i < m; i++) cout << (i%4==1?0:1); cout << "\n";
			for (int i = 0; i < m; i++) cout << (i%4==3?0:1); cout << "\n";
			continue;
		}
		else if (m == 2) {
			if (n % 4 <= 1) cout << (n/4) * 6 + 2 * (n%4) << "\n";
			else cout << (n/4) * 6 + 2 * (n%4) - 1 << "\n";
			for (int i = 0; i < n; i++) {
				cout << (i%4==3?0:1) << (i%4==1?0:1) << "\n";
			}
			continue;
		}
		else if (m == 3) {
			if (n % 4 <= 1) cout << (n/4) * 9 + 3 * (n%4) << "\n";
			else cout << (n/4) * 9 + 3 * (n%4) - 1 << "\n";
			for (int i = 0; i < n; i++) {
				cout << (i%4==3?0:1) << (i%4==1?0:1) << (i%4==3?0:1) << "\n";
			}
			continue;
		}
		vector<vector<int>> b(n+4, vector<int>(m));
		vector<int> sum(n+4);
		int co = 0;
		for (int i = 0; i < m; i++) {//构建出第1行
			if (i % 4 == 3) b[0][i] = 0;
			else b[0][i] = 1, co++;
		}
		sum[0] = co; co = 0;
		for (int i = 0; i < m; i++) {//构建出第2行
			if (i % 4 == 1) b[1][i] = 0;
			else b[1][i] = 1, co++;
		}
		sum[1] = co; co = 0;
		for (int i = 0; i < m; i++) {//构建出第3行
			if (i % 4 == 2) b[2][i] = 0;
			else b[2][i] = 1, co++;
		}
		sum[2] = co; co = 0;
		for (int i = 0; i < m; i++) {//构建出第4行
			if (i % 4 == 0) b[3][i] = 0;
			else b[3][i] = 1, co++;
		}
		sum[3] = co; co = 0;
		
		for (int i = 4; i < n+4; i++) {
			for (int j = 0; j < m; j++) b[i][j] = b[i-4][j];
			sum[i] = sum[i-4];
		}
		for (int i = 1; i < n+4; i++) sum[i] += sum[i-1];
		
		int Max = 0, pos = -1;
		for (int i = 0; i < 4; i++) {
			if (b[3][m-1] == 0 && n%4==1 && i == 0) {//不能从第一行开始
				continue;
			}
			int tmp = sum[i+n-1];
			if (i) tmp -= sum[i-1];
			if (tmp > Max) Max = tmp, pos = i;
		}
		cout << Max << "\n";
		for (int i = pos; i < pos + n; i++) {
			for (int j = 0; j < m; j++) {
				cout << b[i][j];
			}
			cout << "\n";
		}
	}
	return 0;
}
/*
input                                                                             
1
3 7
output
17
1110111
1011101
1110111
*/