#include <bits/stdc++.h>

#define int long long
#define all(a) (a).begin(), (a).end()
#define sz(a) (int) (a).size()
#define forn(i, n) for(int i = 0; i < (n); i++)

using namespace std;

bool b[1000][1000];

struct DSU{
    int dsu[1000 * 1000];
    void in(int n){ for(int i = 0; i <= n; i++) dsu[i] = i; }
    int f(int x){ return x == dsu[x] ? x : dsu[x] = f(dsu[x]); }
    void g(int x, int y) { x = f(x), y = f(y); dsu[x] = y; }
} dsu;

void check(int n, int m){
    dsu.in(n * m);
    forn(i, n) forn(j, m - 1)
        if (b[i][j] && b[i][j + 1])
            dsu.g(i * m + j, i * m + j + 1);
    forn(i, n - 1) forn(j, m)
        if (b[i][j] && b[i + 1][j])
            dsu.g(i * m + j, (i + 1) * m + j);
    vector<int> h;
    forn(i, n) forn(j, m)
        if (b[i][j]) h.push_back(dsu.f(i * m + j));
    for(int i = 1; i < h.size(); i++){
        assert(h[i] == h[0]);
    }
    forn(i, n) forn(j, m - 3)
        assert(!(b[i][j] && b[i][j + 1] && b[i][j + 2] && b[i][j + 3]));
    forn(i, n - 3) forn(j, m)
        assert(!(b[i][j] && b[i + 1][j] && b[i + 2][j] && b[i + 3][j]));
}

void solve(){
    int n, m; cin >> n >> m;
    bool swapped = false;
    if(n > m) {
        swapped = true;
        swap(n, m);
    }
    if(n <= 3 && m <= 3){
        forn(i, n) forn(j, m) b[i][j] = 1;
    }else if(n == 3){
        forn(i, n) forn(j, m) {
            int ri = i % 4, rj = j % 4;
            if(ri == 0 && rj == 3 || ri == 1 && rj == 3 || ri == 2 && rj == 1){
                b[i][j] = 0;
            }else{
                b[i][j] = 1;
            }
        }
    }else{
        if (n % 4 == 3 && m % 4 == 1) {
            swapped ^= 1;
            swap(n, m);
        }
        vector<int> c = n == 2 || n % 4 == 0 || m % 4 == 0 ? vector<int>{1, 3, 0, 2} : vector<int>{3, 2, 0, 1};
        forn(i, n) forn(j, m) {
            int ri = i % 4, rj = j % 4;
            if(rj == c[ri]){
                b[i][j] = 0;
            }else{
                b[i][j] = 1;
            }
        }
    }

    int total = 0;
    forn(i, n) forn(j, m) total += b[i][j];

    check(n, m);
#ifdef LOCAL
    int potent = (n / 4 * 3) * (m % 4) + (n % 4) * (m / 4 * 3) + ((n / 4) * (m / 4) * 12);
    int diff = (n % 4) * (m % 4) - (total - potent);
    if(diff) cout << "DIFF = " << diff << ' ' << n << ' ' << m << endl;
#else
    cout << total << '\n';
    if (swapped) {
        forn(i, m) {
            forn(j, n) cout << b[j][i];
            cout << '\n';
        }
    }else{
        forn(i, n) {
            forn(j, m) cout << b[i][j];
            cout << '\n';
        }
    }
#endif
}

int32_t main(){
    cin.tie(0); cout.tie(0)->sync_with_stdio(false);
    int t = 1;
    cin >> t;
    while(t--){
        solve();
    }
}