#include<iostream>
#include<cstring>
#include<vector>
#include<queue>
using namespace std;
using LL = long long;

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int T;
    cin >> T;
    while(T--){
        int n, m;
        cin >> n >> m;
        if (n <= 3 && m <= 3){
            cout << n * m << '\n';
            for(int i = 0; i < n; i++)
                cout << string(m, '1') << '\n';
            continue;
        }
        pair<int, int> best;
        int mx = 0;

        vector<pair<int, int> > p{{0, 1}, {1, 3}, {2, 0}, {3, 2}};

        auto get = [&](int x, int y){
            vector<string> g(n, string(m, '1'));
            int ans = n * m;
            for(int i = 0; i < n; i++){
                for(int j = 0; j < m; j++){
                    int xx = (i + x) % 4, yy = (j + y) % 4;
                    for(auto &[tx, ty] : p){
                        if (xx == tx && yy == ty){
                            g[i][j] = '0';
                            ans--;
                        }
                    }
                }
            }
            vector<vector<bool> > v(n, vector<bool>(m));
            int cnt = 0;

            auto bfs = [&](int x, int y){
                static const int dx[4] = {-1, 0, 1, 0};
                static const int dy[4] = {0, -1, 0, 1};
                queue<pair<int, int> > q;
                q.push({x, y});
                v[x][y] = true;
                while(!q.empty()){
                    auto [tx, ty] = q.front();
                    q.pop();
                    for(int u = 0; u < 4; u++){
                        int xx = tx + dx[u], yy = ty + dy[u];
                        if (xx < 0 || xx >= n || yy < 0 || yy >= m) continue;
                        if (g[xx][yy] == '0' || v[xx][yy]) continue;
                        v[xx][yy] = true;
                        q.push({xx, yy});
                    } 
                }
            };

            for(int i = 0; i < n; i++){
                for(int j = 0; j < m; j++){
                    if (g[i][j] == '0' || v[i][j]) continue;
                    if (++cnt == 2) return 0;
                    bfs(i, j);
                }
            }
            return ans;
        };

        for(int i = 0; i < 4; i++){
            for(int j = 0; j < 4; j++){
                int t = get(i, j);
                if (t > mx){
                    mx = t;
                    best = {i, j};
                }
            }
        }
        vector<string> g(n, string(m, '1'));
        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                int xx = (i + best.first) % 4, yy = (j + best.second) % 4;
                for(auto &[tx, ty] : p){
                    if (xx == tx && yy == ty){
                        g[i][j] = '0';
                    }
                }
            }
        }
        cout << mx << '\n';
        for(auto &s : g) cout << s << '\n';
    }

}