#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using i128 = __int128;
using u128 = unsigned __int128;
template <typename T>
void chkmax(T &x, const T &y) {
  if (x < y) x = y;
}
template <typename T>
void chkmin(T &x, const T &y) {
  if (y < x) x = y;
}
constexpr int MAXN = 1010;
constexpr int dx[4] = {0, 1, 0, -1};
constexpr int dy[4] = {1, 0, -1, 0};
int n, m, ans;
bool a[MAXN][MAXN], res[MAXN][MAXN];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int cas;
  cin >> cas;
  while (cas--) {
    cin >> n >> m;
    if (n <= 3 && m <= 3) {
      cout << n * m << "\n";
      for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) cout << '1';
        cout << "\n";
      }
      continue;
    }
    bool flp = false;
    if (m == 2) {
      swap(n, m);
      flp = true;
    }
    ans = 0;
    static int p[4] = {0, 1, 2, 3};
    do {
      int cnt = 0;
      for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
          a[i][j] = ((p[i % 4] + j) % 4 != 0);
          cnt += a[i][j];
        }
      }
      if (cnt > ans) {
        bool can = true;
        for (int i = 1; i <= n; ++i) {
          for (int j = 1; j <= m; ++j) {
            if (a[i][j]) {
              static pair<int, int> qu[MAXN * MAXN];
              static bool vis[MAXN][MAXN];
              int hd, tl;
              for (int x = 1; x <= n; ++x) fill(vis[x] + 1, vis[x] + m + 1, false);
              vis[i][j] = true;
              qu[hd = tl = 1] = {i, j};
              while (hd <= tl) {
                int cx, cy;
                tie(cx, cy) = qu[hd++];
                for (int t = 0; t < 4; ++t) {
                  int nx = cx + dx[t], ny = cy + dy[t];
                  if (a[nx][ny] && !vis[nx][ny]) {
                    vis[nx][ny] = true;
                    qu[++tl] = {nx, ny};
                  }
                }
              }
              if (tl == cnt) {
                for (int t = 1; t <= n; ++t)
                  copy(a[t] + 1, a[t] + m + 1, res[t] + 1);
                ans = cnt;
              }
              can = false;
              break;
            }
          }
          if (!can) break;
        }
      }
    } while (next_permutation(p, p + 4));
    cout << ans << "\n";
    if (flp) {
      for (int j = 1; j <= m; ++j) {
        for (int i = 1; i <= n; ++i) cout << res[i][j];
        cout << "\n";
      }
    } else {
      for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) cout << res[i][j];
        cout << "\n";
      }
    }
  }
  return 0;
}
/*
g++ wrong.cpp -o wrong -std=c++14 -O2 -Wall -Wextra -Wshadow -g
-fsanitize=address,undefined
*/