#include <iostream>

const int N = 1005;
const int pat[][4][4] = {
  {
    {1, 1, 0, 1},
    {1, 0, 1, 1},
    {1, 1, 1, 0},
    {0, 1, 1, 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, 1, 0, 1},
    {1, 1, 1, 0},
    {1, 0, 1, 1},
    {0, 1, 1, 1}
  }
};

int ans[N][N], now[N][N];

int main() {
  int T;
  scanf("%d", &T);
  while (T--) {
    int n, m;
    scanf("%d %d", &n, &m);
    int mx = 0;
    if (n < 4 && m < 4) {
      for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
          ans[i][j] = 1;
        }
      }
      mx = n * m;
    }
    for (int k = 0; k < 4; ++k) {
      for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
          now[i][j] = pat[k][i % 4][j % 4];
        }
      }
      if (k == 2 && n % 4 == 0) {
        now[n - 1][0] = 0;
      }
      if (k == 3 && m % 4 == 0) {
        now[0][m - 1] = 0;
      }
      int sum = 0;
      for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
          sum += now[i][j];
        }
      }
      if (sum > mx) {
        for (int i = 0; i < n; ++i) {
          for (int j = 0; j < m; ++j) {
            ans[i][j] = now[i][j];
          }
        }
        mx = sum;
      }
    }
    printf("%d\n", mx);
    for (int i = 0; i < n; ++i) {
      for (int j = 0; j < m; ++j) {
        printf("%d", ans[i][j]);
      }
      puts("");
    }
  }
  return 0;
}