#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;

const int form1[3][4] = {{1,0,1,1},{1,1,1,0},{1,1,1,0}};
const int form2[4][4] = {{1,1,1,0},
                         {0,1,1,1},
                         {1,1,0,1},
                         {1,0,1,1}};
// const int op[8][2] = {{0,2},{0,3},{1,0},{1,0},{1,3},{1,3},{0,3},{0,3}};

int T, n, m, ans, mp[1010][1010], mp1[1010][1010];


void print(const bool&flag) {
    printf("%d\n", ans);
    if (!flag) {
        for (int i = 1;i <= n;++i, putchar('\n'))
            for (int j = 1;j <= m;++j)
                printf("%d", mp[i][j]);
    }
    else {
        for (int i = 1;i <= m;++i, putchar('\n'))
            for (int j = 1;j <= n;++j)
                printf("%d", mp[j][i]);
    }
}

bool vis1[1010][1010];
int kd[5];

void dfs1(int x,int y) {
    if (!mp1[x][y] || !x || !y || x > n || y > m || vis1[x][y])
        return;
    vis1[x][y] = 1;
    dfs1(x+1, y);
    dfs1(x-1, y);
    dfs1(x, y-1);
    dfs1(x, y+1);
}

bool check() {
    for (int i = 1;i <= n;++i)
        for (int j = 1;j <= m;++j)
            mp1[i][j] = form2[kd[(i-1)%4]][(j-1)%4], vis1[i][j] = 0;
    if (mp1[1][1] == 0)
        dfs1(1, 2);
    else
        dfs1(1, 1);
    // for (int i = 1;i <= n;++i, putchar('\n'))
    //     for (int j = 1;j <= m;++j)
    //         printf("++%d:%d ", mp1[i][j], vis1[i][j]);
    for (int i = 1;i <= n;++i)
        for (int j = 1;j <= m;++j)
            if (mp1[i][j] && !vis1[i][j])
                return false;
    return true;
}

bool vis[5];

bool dfs(int c) {
    if (c == 5) {
        if (check()) {
        int cnt = 0;
        for (int i = 1;i <= n;++i)
            for (int j = 1;j <= m;++j)
                cnt += mp1[i][j];
        if (cnt > ans) {
            ans = cnt;
        for (int i = 1;i <= n;++i)
            for (int j = 1;j <= m;++j)
                mp[i][j] = mp1[i][j];
        }
        }
    }
    for (int i = 0;i < 4;++i)
        if (!vis[i]) {
            vis[i] = 1, kd[c-1] = i;
            dfs(c+1);
            vis[i] = 0;
        }
    return false;
}

int main() {
    scanf("%d", &T);
    while (T--) {
        scanf("%d%d", &n, &m), ans = 0;
        bool flag;
        if (n <= m)
            flag = 0;
        else
            flag = 1, swap(n, m);
        if (n <= 3 && m <= 3) {
            for (int i = 1;i <= n;++i)
                for (int j = 1;j <= m;++j)
                    mp[i][j] = 1;
            ans = n*m;
            print(flag);
            continue;
        }
        if (n <= 3) {
            for (int i = 1;i <= n;++i)
                for (int j = 1;j <= m;++j)
                    ans += (mp[i][j] = form1[i-1][(j-1)%4]);
            print(flag);
            continue;
        }
        dfs(1);
        // int cnt1 = 0, cnt2 = 0;
        // for (int i = 5, j = 0;i <= n;++i, ++j) 
        //     if (op[j%8][0])
        //         ++cnt2;
        //     else
        //         ++cnt1;
        // int ii = op[n-4][1];
        // for (int i = 1, j = cnt1;j;++i, --j) 
        //     for (int k = 1;k <= m;++k)
        //         ans += (mp[i][k] = form2[(4-j%4)%4][(k+ii-1)%4]);
        // for (int i = cnt1+1;i <= cnt1+4;++i)
        //     for (int j = 1;j <= m;++j)
        //         ans += (mp[i][j] = form2[i-cnt1-1][(j+ii-1)%4]);
        // for (int i = cnt1+5, j = cnt2;j;++i, --j)
        //     for (int k = 1;k <= m;++k)
        //         ans += (mp[i][k] = form2[(k-1)%4][(k+ii-1)%4]);
        print(flag);
    }
    return 0;
}