#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++)
#ifdef LOCAL
#define show(x) cerr << #x << " = " << x << endl;
#else
#define show(x) true
#endif

template<class T> ostream &operator<<(ostream &os, vector<T> &v) {
    os << "[ ";
    for (auto& e : v) os << e << ", ";
    return os << " ]";
}

void solve() {
    int N,M; cin >> N >> M;
    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};
        int cnt = N*M;
        vector<string> A(N);
        rep(i,N){
            A[i] = bs[i%4];
            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){
            int cnt = N*M;
            string bs(M,'1');
            vector<string> A(N,bs);
            for(int y=0;y<N;y++){
                for(int j=p[i+y%4];j<M;j+=4){
                    A[y][j] = '0';
                    cnt--;
                }
            }
            if(A[0][0]=='1' && A[0][1]=='0' && A[1][0]=='0'){
                A[0][0] = '0';
                cnt--;
            }
            if(A[0][M-1]=='1' && A[0][M-1-1]=='0' && A[1][M-1]=='0'){
                A[0][M-1] = '0';
                cnt--;
            }
            if(A[N-1][0]=='1' && A[N-1][1]=='0' && A[N-1-1][0]=='0'){
                A[N-1][0] = '0';
                cnt--;
            }
            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';
                cnt--;
            }
            if(ans < cnt){
                ans = cnt;
                Ans = A;
            }
        }
        cout << ans << '\n';
        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;
}