#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


vector<int> uf;
int root(int u) {
  return (uf[u] < 0) ? u : (uf[u] = root(uf[u]));
}
bool connect(int u, int v) {
  u = root(u);
  v = root(v);
  if (u == v) return false;
  if (uf[u] > uf[v]) swap(u, v);
  uf[u] += uf[v];
  uf[v] = u;
  return true;
}


// 1x4 as many as possible
int bound(int M, int N) {
  if (M > N) {
    swap(M, N);
  }
  if (M <= 3) {
    return M * (N / 4);
  } else {
    int ret = (M * N) / 4;
    if (M % 4 == 2 && N % 4 == 2) {
      --ret;
    }
    return ret;
  }
}

vector<string> solve(int M, int N) {
  vector<string> ans(M, string(N, '1'));
  if (M > N) {
    const auto res = solve(N, M);
    for (int x = 0; x < M; ++x) for (int y = 0; y < N; ++y) {
      ans[x][y] = res[y][x];
    }
  } else {
    if (N <= 3) {
      // all 1
    } else if (M <= 3) {
      const int Y0[4] = {3, 1};
      for (int x = 0; x < M; ++x) {
        for (int y = Y0[x % 2]; y < N; y += 4) {
          ans[x][y] = '0';
        }
      }
    } else {
      vector<int> Y0 = {1, 3, 0, 2};
      if (false) {
      } else if (M % 4 == 1 && N % 4 == 2) {
        Y0 = {2, 0, 1, 3};
      } else if (M % 4 == 1 && N % 4 == 3) {
        Y0 = {3, 1, 2, 0};
      } else if (M % 4 == 2 && N % 4 == 2) {
        // special
        Y0 = {2, 3, 1, 0};
      } else if (M % 4 == 3 && N % 4 == 1) {
        Y0 = {3, 1, 2, 0};
      } else if (M % 4 == 3 && N % 4 == 2) {
        Y0 = {3, 1, 2, 0};
      }
      for (int x = 0; x < M; ++x) {
        for (int y = Y0[x % 4]; y < N; y += 4) {
          ans[x][y] = '0';
        }
      }
    }
  }
  return ans;
}

void stress() {
  constexpr int lim = 30;
  for (int M = 2; M <= lim; ++M) for (int N = 2; N <= lim; ++N) {
    cerr << "M = " << M << ", N = " << N << endl;
    const int bd = bound(M, N);
    const auto slv = solve(M, N);
    auto judge = [&]() -> int {
      if ((int)slv.size() != M) return __LINE__;
      for (int x = 0; x < M; ++x) {
        if ((int)slv[x].size() != N) return __LINE__;
      }
      for (int x = 0; x < M; ++x) for (int y = 0; y < N; ++y) {
        if (!(slv[x][y] == '0' || slv[x][y] == '1')) return __LINE__;
      }
      for (int x = 0; x < M; ++x) {
        for (int y = 0; y + 4 <= N; ++y) {
          if (slv[x][y] == slv[x][y + 1] && slv[x][y] == slv[x][y + 2] && slv[x][y] == slv[x][y + 3]) return __LINE__;
        }
      }
      for (int y = 0; y < N; ++y) {
        for (int x = 0; x + 4 <= M; ++x) {
          if (slv[x][y] == slv[x + 1][y] && slv[x][y] == slv[x + 2][y] && slv[x][y] == slv[x + 3][y]) return __LINE__;
        }
      }
      uf.assign(M * N, -1);
      for (int x = 0; x < M; ++x) for (int y = 0; y < N; ++y) if (slv[x][y] == '1') {
        if (x + 1 < M && slv[x + 1][y] == '1') connect(x * N + y, (x + 1) * N + y);
        if (y + 1 < N && slv[x][y + 1] == '1') connect(x * N + y, x * N + (y + 1));
      }
      int numComps = 0;
      for (int x = 0; x < M; ++x) for (int y = 0; y < N; ++y) if (slv[x][y] == '1') {
        if (uf[x * N + y] < 0) ++numComps;
      }
      if (numComps != 1) return __LINE__;
      return 0;
    };
    const int verdict = judge();
    if (verdict) {
      cerr << "M = " << M << ", N = " << N << endl;
      for (const auto &row : slv) {
        cerr << row << endl;
      }
      cerr << "  verdict = " << verdict << endl;
      assert(false);
    }
    int cnt0 = 0;
    for (int x = 0; x < M; ++x) for (int y = 0; y < N; ++y) if (slv[x][y] == '0') {
      ++cnt0;
    }
    if (cnt0 != bd) {
      cerr << "M = " << M << ", N = " << N << endl;
      for (int x = 0; x < M; ++x) {
        cerr << slv[x] << endl;
      }
      cerr << "  bd = " << bd << endl;
      cerr << "  cnt0 = " << cnt0 << endl;
      if (M == 2 || N == 2) continue;
      if (M == 3 || N == 3) continue;
      assert(false);
    }
  }
}

int main() {
  // stress(); return 0;
  
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    int M, N;
    scanf("%d%d", &M, &N);
    
    const auto ans = solve(M, N);
    int cnt1 = 0;
    for (int x = 0; x < M; ++x) for (int y = 0; y < N; ++y) if (ans[x][y] == '1') {
      ++cnt1;
    }
    
    printf("%d\n", cnt1);
    for (int x = 0; x < M; ++x) {
      puts(ans[x].c_str());
    }
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}