#include <bits/stdc++.h>
using namespace std;

#define fopen                                   \
    freopen("E:/vscode/oi/in.txt", "r", stdin); \
    freopen("E:/vscode/oi/out.txt", "w", stdout);
#define fc         \
    fclose(stdin); \
    fclose(stdout);
#define ios                  \
    ios::sync_with_stdio(0); \
    cin.tie(0);

#define ll long long
#define vint vector<int>
#define pii pair<int, int>
#define pdd pair<double, double>
#define vnode vector<node>
#define ld long double
#define ls(x) (x << 1)
#define rs(x) (x << 1 | 1)
#define lowbit(x) (x & -x)

const int N = 1e3 + 10, M = 4e5 + 10;
const double eps = 1e-12;
const double PI = acos(-1);

void solve()
{
    int n, m, res = 0;
    cin >> n >> m;
    if (n <= 3 && m <= 3)
    {
        res = n * m;
        cout << res << '\n';
        for (int i = 1; i <= n; i++)
        {
            for (int j = 1; j <= m; j++)
                cout << '1';
            cout << '\n';
        }
    }
    else if (n <= 3)
    {
        res = n * m;
        vector<vint> a(n + 1, vint(m + 1, 1));
        for (int i = 1; i <= n; i++)
            if (i & 1)
                for (int j = 2; j <= m; j += 4)
                    a[i][j] = 0, res--;
            else
                for (int j = 4; j <= m; j += 4)
                    a[i][j] = 0, res--;
        cout << res << '\n';
        for (int i = 1; i <= n; i++)
        {
            for (int j = 1; j <= m; j++)
                cout << a[i][j];
            cout << '\n';
        }
    }
    else if (m <= 3)
    {
        res = n * m;
        vector<vint> a(n + 1, vint(m + 1, 1));
        for (int i = 1; i <= n; i++)
            if (i & 1)
                for (int j = 2; j <= m; j += 4)
                    a[j][i] = 0, res--;
            else
                for (int j = 4; j <= m; j += 4)
                    a[j][i] = 0, res--;
        cout << res << '\n';
        for (int i = 1; i <= n; i++)
        {
            for (int j = 1; j <= m; j++)
                cout << a[i][j];
            cout << '\n';
        }
    }
    else
    {
        vector<vint> a(n + 5, vint(m + 5, 1)), s(n + 5, vint(m + 5));
        for (int i = 1; i <= n + 4; i++)
            for (int j = 1; j <= m + 4; j++)
            {
                if (i % 4 == 1 && j % 4 == 0)
                    a[i][j] = 0;
                else if (i % 4 == 2 && j % 4 == 2)
                    a[i][j] = 0;
                else if (i % 4 == 3 && j % 4 == 1)
                    a[i][j] = 0;
                else if (i % 4 == 0 && j % 4 == 3)
                    a[i][j] = 0;
                s[i][j] = s[i - 1][j - 1] + a[i][j] - s[i - 1][j] - s[i][j - 1];
            }
        int x = 0, y = 0;
        for (int i = 0; i < 4; i++)
            for (int j = 0; j < 4; j++)
            {
                int sum = s[n + i][m + j] + s[i][j] - s[n + i][j] - s[i][m + j];
                if (sum > res)
                {
                    res = sum;
                    x = i, y = j;
                }
            }
        cout << res << '\n';
        for (int i = 1 + x; i <= n + x; i++)
        {
            for (int j = 1 + y; j <= m + y; j++)
                cout << a[i][j];
            cout << '\n';
        }
    }
}

signed main()
{
    ios;
    // fopen;

    int t = 1;
    srand(time(0));

    cin >> t;
    for (int i = 1; i <= t; i++)
    {
        solve();
    }

    return 0;
}