#include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << #x << " == " << x << endl
#define el '\n'
typedef long long ll;
const int mod = 1000000007;
const int inf = 2147483647;
const int N = 200020;
int w1[4][4] = {1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1};
int w2[4][4] = {1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1};
void print(int n, int m, int flag, vector<vector<int>> a)
{
	int ans = 0;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			ans += a[i][j];
		}
	}
	cout << ans << el;
	if (flag == 0) {
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= m; j++) {
				cout << a[i][j];
			}
			cout << el;
		}
		return;
	}
	for (int i = 1; i <= m; i++) {
		for (int j = 1; j <= n; j++) {
			cout << a[j][i];
		}
		cout << el;
	}
}
void solve()
{
	int n, m, flag = 0;
	cin >> n >> m;
	if (m < n) {
		swap(n, m);
		flag = 1;
	}
	if (m % 4 == 0 && n >= 4 && m >= 4) {
		swap(n, m);
		flag ^= 1;
	}
	vector<vector<int>> a(n + 1, vector<int>(m + 1, 0));
	if (n == 1) {
		a[1][1] = a[1][2] = a[1][3] = 1;
		print(n, m, flag, a);
		return;
	}
	if (n == 2) {
		if (m == 2 || m == 3) {
			for (int i = 1; i <= n; i++)
				for (int j = 1; j <= m; j++)
					a[i][j] = 1;
		}
		else {
			for (int i = 1; i <= m; i++) {
				switch (i % 4) {
					case 0:
						a[1][i] = 0, a[2][i] = 1;
						break;
					case 1:
						a[1][i] = 1, a[2][i] = 1;
						break;
					case 2:
						a[1][i] = 1, a[2][i] = 0;
						break;
					default:
						a[1][i] = 1, a[2][i] = 1;
						break;
				}
			}
		}
		print(n, m, flag, a);
		return;
	}
	if (n == 3) {
		if (m == 3) {
			for (int i = 1; i <= n; i++)
				for (int j = 1; j <= m; j++)
					a[i][j] = 1;
		}
		else {
			for (int i = 1; i <= m; i++) {
				switch (i % 4) {
					case 1:
						a[1][i] = 1, a[2][i] = 1, a[3][i] = 1;
						break;
					case 2:
						a[1][i] = 1, a[2][i] = 0, a[3][i] = 1;
						break;
					case 3:
						a[1][i] = 1, a[2][i] = 1, a[3][i] = 1;
						break;
					default:
						a[1][i] = 0, a[2][i] = 1, a[3][i] = 0;
						break;
				}
			}
		}
		print(n, m, flag, a);
		return;
	}
	if (n % 4 == 0 || n % 4 == 1) {
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= m; j++) {
				int x = (i % 4 == 0) ? 3 : i % 4 - 1;
				int y = (j % 4 == 0) ? 3 : j % 4 - 1;
				a[i][j] = w1[x][y];
			}
		}
		print(n, m, flag, a);
		return;
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			int x = (i % 4 == 0) ? 3 : i % 4 - 1;
			int y = (j % 4 == 0) ? 3 : j % 4 - 1;
			a[i][j] = w2[x][y];
		}
	}
	print(n, m, flag, a);
	return;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int T = 1;
	cin >> T;
	while (T--) {
		solve();
	}
	return 0;
}