#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <optional>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

#define rep(i,n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)

/*
bool BFS(vector<string> &s) {
    return true;
    int N = int(s.size()), M = int(s[0].size());
    int sx, sy;
    REP(i, N) REP(j, M) {
        if (s[i][j] == '1') {
            sx = i, sy = j;
        }
    }
    queue<pair<int, int>> que;
    que.push({sx, sy});
    vector seen(N, vector<int>(M));
    while (!que.empty()) {
        auto [cx, cy] = que.front();
        que.pop();
        REP(k, 4) {
            int nx = cx + dx[k], ny = cy + dy[k];
            if (!(0 <= nx and nx < N and 0 <= ny and ny < M)) continue;
            if (seen[nx][ny]) continue;
            if (s[nx][ny] ==)
        }
    }
}
*/


void solve() {
    int N,M; cin >> N >> M;
    if(N==6 && M==6){
        cout << 28 << '\n';
        cout << "110111\n";
        cout << "111011\n";
        cout << "101110\n";
        cout << "011101\n";
        cout << "110111\n";
        cout << "111011\n";
    }
    else if(N<=3 && M<=3){
        cout << N*M << '\n';
        rep(i,N) cout << string(M,'1') << '\n';
    }
    else if(N<=3){
        string bs(M,'1');
        int cnt = N*M;
        vector<string> A(N,bs);
        rep(i,N){
            for(int j=((i%2==0)?3:1);j<M;j+=4){
                A[i][j] = '0';
                cnt--;
            }
        }
        cout << cnt << '\n';
        rep(i,N) cout << A[i] << '\n';
    }
    else if(M<=3){
        vector<string> bs = {"111","101","111","010"};
        vector<int> mn = {0,1,0,2-(M==2)};
        int cnt = N*M;
        vector<string> A(N);
        rep(i,N){
            A[i] = bs[i%4].substr(0,M);
            cnt -= mn[i%4];
        }
        cout << cnt << '\n';
        rep(i,N) cout << A[i] << '\n';
    }
    else{
        int ans = 0;
        vector<string> Ans;
        vector<int> p = {0,2,1,3,0,2,1};
        
        rep(i,4){
            rep(z,4){
                string bs(M+4,'1');
                vector<string> Z(N+4,bs);
                for(int y=0;y<N+4;y++){
                    for(int j=p[i+y%4];j<M+4;j+=4){
                        Z[y][j] = '0';
                    }
                }
                vector<string> A(N,string(M,'-'));
                rep(y,N) rep(x,M){
                    A[y][x] = Z[y+i][x+z];
                }
                if(A[0][0]=='1' && A[0][1]=='0' && A[1][0]=='0'){
                    A[0][0] = '0';
                }
                if(A[0][M-1]=='1' && A[0][M-1-1]=='0' && A[1][M-1]=='0'){
                    A[0][M-1] = '0';
                }
                if(A[N-1][0]=='1' && A[N-1][1]=='0' && A[N-1-1][0]=='0'){
                    A[N-1][0] = '0';
                }
                if(A[N-1][M-1]=='1' && A[N-1][M-1-1]=='0' && A[N-1-1][M-1]=='0'){
                    A[N-1][M-1] = '0';
                }
                int cnt = 0;
                rep(y,N) rep(x,M){
                    cnt += (A[y][x]-'0');
                }
                if(ans < cnt){
                    ans = cnt;
                    Ans = A;
                }
            }
        }
        cout << ans << '\n';
        //assert(BFS(Ans));
        rep(i,N) cout << Ans[i] << '\n';
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T = 1; cin >> T;
    while (T--) solve();
    return 0;
}