#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ALL(x) (x).begin(), (x).end()
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif
template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (size_t i = 0; i < v.size(); i++) {
        os << v[i] << (i + 1 == v.size() ? "" : " ");
    }
    return os;
}

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
int topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
int botbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }
int botbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); }
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(long long t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }
long long MSK(int n) { return (1LL << n) - 1; }

template <class T> T ceil(T x, T y) {
    assert(y >= 1);
    return (x > 0 ? (x + y - 1) / y : x / y);
}
template <class T> T floor(T x, T y) {
    assert(y >= 1);
    return (x > 0 ? x / y : (x - y + 1) / y);
}

template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <typename T> void mkuni(vector<T>& v) {
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
}
template <typename T> int lwb(const vector<T>& v, const T& x) { return lower_bound(v.begin(), v.end(), x) - v.begin(); }

const int INF = (1 << 30) - 1;
const long long IINF = (1LL << 60) - 1;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const int MOD = 998244353;
// const int MOD = 1000000007;

int one[4] = {1, 1, 1, 0};

int two[2][4] = {{1, 1, 1, 0}, {1, 0, 1, 1}};
int three[3][4] = {{1, 1, 1, 0}, {1, 1, 1, 0}, {1, 0, 1, 1}};
vector<vector<vector<int>>> mass = {{{1, 1, 1, 0}, {1, 0, 1, 1}, {0, 1, 1, 1}, {1, 1, 0, 1}},
                                    {{1, 1, 1, 0}, {1, 0, 1, 1}, {0, 1, 1, 1}, {1, 1, 0, 1}},
                                    {{1, 1, 1, 0}, {1, 1, 0, 1}, {0, 1, 1, 1}, {1, 0, 1, 1}},
                                    {{1, 0, 1, 1}, {1, 1, 1, 0}, {1, 1, 0, 1}, {0, 1, 1, 1}}};

vector<vector<int>> solve(int n, int m) {
    vector<vector<int>> res(n, vector<int>(m));
    if (n == 2) {
        if (m <= 3) {
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) {
                    res[i][j] = 1;
                }
            }
            return res;
        }
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                res[i][j] = two[i][j % 4];
            }
        }
        return res;
    }
    if (n == 3) {
        if (m <= 3) {
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) {
                    res[i][j] = 1;
                }
            }
            return res;
        }
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                res[i][j] = three[i][j % 4];
            }
        }
        return res;
    }
    int x = n % 4;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            res[i][j] = mass[x][i % 4][j % 4];
        }
    }
    return res;
}

bool check(int n, int m, vector<vector<int>> res) {
    if (res.size() != n) return false;
    if (res[0].size() != m) return false;
    for (int i = 0; i < n; i++) {
        for (int j = 1, cnt = 1; j < m; j++) {
            if (res[i][j] == res[i][j - 1])
                cnt++;
            else
                cnt = 1;
            if (cnt == 4) return false;
        }
    }
    for (int j = 0; j < m; j++) {
        for (int i = 1, cnt = 1; i < n; i++) {
            if (res[i][j] == res[i - 1][j])
                cnt++;
            else
                cnt = 1;
            if (cnt == 4) return false;
        }
    }
    vector<vector<bool>> seen(n, vector<bool>(m, false));
    queue<pair<int, int>> que;
    for (int i = 0, f = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (res[i][j] != 1) continue;
            if (seen[i][j]) continue;
            if (f) return false;
            f = 1;
            seen[i][j] = true;
            que.emplace(i, j);
            while (not que.empty()) {
                auto [x, y] = que.front();
                que.pop();
                for (int k = 0; k < 4; k++) {
                    int nx = x + dx[k], ny = y + dy[k];
                    if (nx < 0 or n <= nx or ny < 0 or m <= ny) continue;
                    if (res[nx][ny] != 1) continue;
                    if (seen[nx][ny]) continue;
                    seen[nx][ny] = true;
                    que.emplace(nx, ny);
                }
            }
        }
    }
    return true;
}

vector<vector<int>> solve1(int n, int m) {
    int flag = 0;
    if (n > m) {
        swap(n, m);
        flag ^= 1;
    }
    if (n > 4 and m % 4 == 0) {
        swap(n, m);
        flag ^= 1;
    }
    auto res = solve(n, m);
    if (flag) {
        vector<vector<int>> nres(m, vector<int>(n));
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                nres[j][i] = res[i][j];
            }
        }
        swap(res, nres);
        swap(n, m);
    }
    if (not check(n, m, res)) {
        debug(n, m);
        for (int i = 0; i < n; i++) cout << res[i] << '\n';
    }
    return res;
}

void test() {
    for (int n = 2; n < 20; n++) {
        for (int m = 2; m < 20; m++) {
            solve1(n, m);
        }
    }
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // test();
    // return 0;
    int T;
    cin >> T;
    for (; T--;) {
        int n, m;
        cin >> n >> m;
        auto res = solve1(n, m);
        int sum = 0;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                sum += res[i][j];
            }
        }
        cout << sum << '\n';
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) cout << res[i][j];
            cout << '\n';
        }
    }
    return 0;
}