#include <bits/stdc++.h>

using namespace std;

int solve();

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

const int N = 1005;

int ans[N][N];
int n, m;
int cnt;

const int d[2][5] = {{0, 4, 2, 3, 1}, {0, 4, 2, 4, 0}};

void print() {
    cnt = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            cnt += ans[i][j];
        }
    }
    cout << cnt << "\n";
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            cout << ans[i][j];
        }
        cout << "\n";
    }
}

int solve() {
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            ans[i][j] = 0;
        }
    }
    if (n <= 3 && m <= 3) {
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= m; j++) {
                ans[i][j] = 1;
            }
        }
        print();
        return 0;
    }
    if (n == 3 && (m % 4 == 3)) {
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= m; j++) {
                int x = (i - 1) % 4 + 1, y = (j - 1) % 4 + 1;
                if (d[1][x] != y) {
                    ans[i][j] = 1;
                }
            }
        }
        print();
        return 0;
    }
    if (m == 3 && (n % 4 == 3)) {
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= m; j++) {
                int x = (i - 1) % 4 + 1, y = (j - 1) % 4 + 1;
                if (d[1][y] != x) {
                    ans[i][j] = 1;
                }
            }
        }
        print();
        return 0;
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            int x = (i - 1) % 4 + 1, y = (j - 1) % 4 + 1;
            if (d[0][x] != y) {
                ans[i][j] = 1;
            }
        }
    }
    print();
    return 0;
}