#include <bits/stdc++.h>  
using namespace std;  

#define int long long  

constexpr int p[] = {4, 2, 3, 1};

void solve() {
	int n, m;
	cin >> n >> m;

	if (n < 4 && m < 4) {
		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 < 4 || m < 4) {
		bool sw = false;
		if (n > m) {
			swap(n, m);
			sw = true;
		}
		vector a(n + 1, vector<int>(m + 1, 1));
		int sum = n * m;
		for (int i = 1; i <= n; i++) {
			for (int j = p[i - 1]; j <= m; j += 4) {
				a[i][j] = 0;
				sum--;
			}
		} 
		// cerr << "ok\n";
		cout << sum << "\n";
		if (sw) {
			for (int j = 1; j <= m; j++) {
				for (int i = 1; i <= n; i++) {
					cout << a[i][j];
				}
				cout << "\n";
			}
		} else {
			for (int i = 1; i <= n; i++) {
				for (int j = 1; j <= m; j++) {
					cout << a[i][j];
				}
				cout << "\n";
			}
		}
		return;
	}

	int sum = n * m;
	vector a(n + 1, vector<int>(m + 1, 1));
	for (int i = 1; i <= n; i++) {
		for (int j = p[(i - 1) % 4]; j <= m; j += 4) {
			a[i][j] = 0;
			sum--;
		}
	}

	cout << sum << "\n";
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			cout << a[i][j];
		}
		cout << "\n";
	}
}

signed main() {  
    ios::sync_with_stdio(false);
    cin.tie(nullptr);  

    int t;
    cin >> t;
    while (t--) {
    	solve();
    }

    return 0;
}