#include <bits/stdc++.h>
#ifdef dbg
#define D(...) fprintf(stderr, __VA_ARGS__)
#define DD(...) D("[Debug] "#__VA_ARGS__ " = "), \
              debug_helper::debug(__VA_ARGS__), D("\n")
#include "C:\Users\wsyear\Desktop\OI\templates\debug.hpp"
#else
#define D(...) ((void)0)
#define DD(...) ((void)0)
#endif
#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

template<class T> void chkmn(T &x, T y) { if (y < x) x = y; }
template<class T> void chkmx(T &x, T y) { if (y > x) x = y; }

using namespace std;

const int maxn = 1010;

int n, m, flag, a[maxn][maxn], b[maxn][maxn];

void work() {
  cin >> n >> m, flag = (n > m);
  if (n <= 3 && m <= 3) {
    cout << n * m << '\n';
    rep (i, 1, n) {
      rep (j, 1, m) cout << 1;
      cout << "\n";
    }
    return;
  }
  if (n > m) swap(n, m);
  rep (i, 1, n) rep (j, 1, m) a[i][j] = 1;
  if (n == 2) {
    for (int j = 2; j <= m; j += 4) a[1][j] = 0;
    for (int j = 4; j <= m; j += 4) a[2][j] = 0;
  } else if (n == 3) {
    for (int j = 1; j <= m; j += 4) a[1][j] = 0;
    for (int j = 3; j <= m; j += 4) a[2][j] = 0;
    for (int j = 3; j <= m; j += 4) a[3][j] = 0;
  } else {
    rep (i, 1, n) {
      int beg = 0;
      if (i % 4 == 1) beg = 4;
      if (i % 4 == 2) beg = 2;
      if (i % 4 == 3) beg = 3;
      if (i % 4 == 0) beg = 1;
      for (int j = beg; j <= m; j += 4) a[i][j] = 0;
    }
  }
  if (flag) {
    rep (i, 1, n) rep (j, 1, m) b[j][i] = a[i][j];
    swap(n, m);
  } else {
    rep (i, 1, n) rep (j, 1, m) b[i][j] = a[i][j];
  }
  int cnt = 0;
  rep (i, 1, n) rep (j, 1, m) cnt += b[i][j];
  cout << cnt << '\n';
  rep (i, 1, n) {
    rep (j, 1, m) cout << b[i][j];
    cout << '\n';
  }
}

int main() {
  cin.tie(nullptr) -> ios::sync_with_stdio(false);
  int t; cin >> t;
  while (t--) work();
}