#include <bits/stdc++.h>

#define x first
#define y second
#define el '\n'
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int N = 1010, INF = 0x3f3f3f3f, mod = 998244353;

inline int read() {
    int f = 1, k = 0;
    char c = getchar();
    while (c < '0' || c > '9') {
        if (c == '-') f = -1;
        c = getchar();
    }
    while (c >= '0' && c <= '9') {
        k = k * 10 + c - '0';
        c = getchar();
    }
    return f * k;
}

int to[] = {1, 3, 0, 2};
int g[N][N];

void solve() {
    int n = read(), m = read();
    int sum = 0;
    if (n < 4 && m < 4) {
        sum = n * m;
        cout << sum << el;
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < m; ++j) {
                cout << 1;
            }
            cout << el;
        }
        return;
    }
    bool rev = 0;
    if (n < m) swap(n, m), rev = 1;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            if (j % 4 == to[i % 4]) g[i][j] = 0;
            else g[i][j] = 1, ++sum;
        }
    }
    cout << sum << el;
    if (!rev) {
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < m; ++j) {
                cout << g[i][j];
            }
            cout << el;
        }
    }
    else {
        for (int i = 0; i < m; ++i) {
            for (int j = 0; j < n; ++j) {
                cout << g[j][i];
            }
            cout << el;
        }
    }
}

int main() {
    int tcase;
    cin >> tcase;
    while (tcase--) solve();
}