#include "bits/stdc++.h"
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
 
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
 
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template<class T> using pq = priority_queue<T>;
template<class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
 
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a,x) for (auto& a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
 
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define ins insert

template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef DEBUG
#define dbg(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << endl;
#else
#define dbg(x...)
#endif


const int MOD = 1000000007;
const char nl = '\n';
const int MX = 1001; 

int N, M;
int ans;
bool vis[MX][MX];
int bst[MX][MX];
int cur[MX][MX];


int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

bool valid(int x, int y) {
    return x >= 0 && x < N && y >= 0 && y < M;
}

void go(vi vals) {
    int co = N*M;
    F0R(i, N) {
        F0R(j, M) {
            cur[i][j] = 1;
            if (j%4 == vals[i%4]) {
                cur[i][j] = 0;
                co--;
            }
        }
    }
    //dbg(vals, co);
    if (co <= ans) return;
    //dbg("Try", vals);
    int fx = -1, fy = -1;
    F0R(i, N) F0R(j, M) if (cur[i][j] == 1) {
        fx = i; fy = j; break;
    }
    F0R(i, N) F0R(j, M) vis[i][j] = false;
    queue<pi> q; q.push({fx, fy});
    while (!q.empty()) {
        auto [x, y] = q.front(); q.pop();
        F0R(i, 4) {
            int nx = x + dx[i], ny = y + dy[i];
            if (valid(nx, ny) && cur[nx][ny] == 1 && !vis[nx][ny]) {
                vis[nx][ny] = true; q.push({nx, ny});
            }
        }
    }
    F0R(i, N) {
        F0R(j, M) {
            if (!vis[i][j] && cur[i][j] == 1) return;
        }
    }
    ans = co;
    F0R(i, N) {
        F0R(j, M) {
            bst[i][j] = cur[i][j];
        }
    }
    //dbg("OK");
}

void solve() {
    cin >> N >> M;
    ans = 0;
    bool fl = false;
    if (max(N, M) < 4) {
        cout << N*M << nl;
        F0R(i, N) {
            F0R(j, M) {
                cout << 1;
            }
            cout << nl;
        }
        return;
    }
    if (N > M) {
        swap(N, M); fl = true;
    }
    if (N <= 3) {
        F0R(i, 4) {
            F0R(j, 4) {
                F0R(k, 4) {
                    go({i, j, k});
                }
            }
        }
    } else {
        vi perm; F0R(i, 4) perm.pb(i);
        do {
            go(perm);
        } while (next_permutation(all(perm)));
    }
    cout << ans << nl;
    if (fl) {
        F0R(i, M) {
            F0R(j, N) {
                cout << bst[j][i];
            }
            cout << nl;
        }
    } else {
        F0R(i, N) {
            F0R(j, M) {
                cout << bst[i][j];
            }
            cout << nl;
        }
    }

}
 
int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);

    int T = 1;
    cin >> T;
    while(T--) {
        solve();
    }

	return 0;
}