#include <bits/stdc++.h>

#define sz(v) v.size()
#define forn(i,n) for(int i = 0; i < n; ++i)
#define fi first
#define se second
#define el '\n'
#define all(v) v.begin(),v.end()
#define pb push_back
#define d(x) cout << #x << " : " << x << el

using namespace std;

typedef pair<int,int> ii;

int dr[] = {1,0,-1,0};
int dc[] = {0,1,0,-1};

bool check(int i, int j, int n, int m){
  return i >= 0 && j >= 0 && i < n && j < m;
}

int bfs(vector<vector<int>> &a){
  int n = sz(a);
  int m = sz(a[0]);
  queue<ii> q;
  int ans = 0;
  vector<vector<bool>> seen(n, vector<bool>(m));
  forn(i,n){
    forn(j,m){
      if(a[i][j]==1){
        q.push({i,j});
        while(sz(q)){
          ii cur = q.front();
          q.pop();
          ++ans;
          forn(k,4){
            int ni = i + dr[k];
            int nj = j + dc[k];
            if(check(ni,nj,n,m) && !seen[ni][nj] && a[ni][nj]){
              q.push({ni,nj});
              seen[ni][nj] = 1;
            }
          }
        }
        break;
      }
    }
  }
  return ans;
}

int contar(vector<vector<int>> &a){
  int ans = 0;
  for(vector<int> &b : a){
    for(int x : b){
      ans += x;
    }
  }
  return ans;
}

vector<vector<int>> solve(int n, int m){
  vector<vector<int>> g(n, vector<int>(m));
  
  if(n<=3){
    for(int i = 0; i < n; ++i){
      for(int j = 0; j < m; ++j){
        if(i%2 == 0){
          g[i][j] = (j%4!=3);
        }else if(i == 1){
          g[i][j] = (j%4!=1);
        }
      }
    }
    return g;
  }
  if(n%4){
    for(int i = 0; i < n; ++i){
      for(int j = 0; j < m; ++j){
        if(i%4==0){
          g[i][j] = (j%4!=3);
        }else if(i%4==1){
          g[i][j] = (j%4!=2);
        }else if(i%4==2){
          g[i][j] = (j%4!=0);
        }else if(i%4==3){
          g[i][j] = (j%4!=1);
        }
      }
    }
    if(bfs(g) != contar(g)){
      g = vector<vector<int>>(n, vector<int>(m));
    }
  }
  vector<vector<int>> g2(n, vector<int>(m));
  for(int i = 0; i < n; ++i){
    for(int j = 0; j < m; ++j){
      if(i%4==0){
        g2[i][j] = (j%4!=3);
      }else if(i%4==1){
        g2[i][j] = (j%4!=1);
      }else if(i%4==2){
        g2[i][j] = (j%4!=2);
      }else if(i%4==3){
        g2[i][j] = (j%4!=0);
      }
    }
  }
  if(contar(g) < contar(g2)) return g2;
  return g;
}

vector<vector<int>> transpose(vector<vector<int>> &a){
  
  int n = sz(a);
  int m = sz(a[0]);
  vector<vector<int>> b(m, vector<int>(n));
  forn(i,n){
    forn(j,m){
      b[j][i] = a[i][j];
    }
  }
  return b;
}



int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL); cout.tie(NULL);
  cout << setprecision(20)<< fixed;

  int t;
  cin >> t;
  while(t--){
    int n, m;
    cin >> n >> m;
    if(n <= 3 && m <= 3){
      cout << n * m << el;
      forn(i,n){
        forn(j,m){
          cout << 1;
        }
        cout << el;
      }
      continue;
    }
    vector<vector<int>> ans;
    if(n >= 4 && m>= 4){
      ans = solve(n, m);
      auto ans2 = solve(m, n);
      ans2 = transpose(ans2);
      if(contar(ans) < contar(ans2)) ans = ans2;
    }else{
      if(n > m){
        ans = solve(m, n);
        ans = transpose(ans);
      }else{
        ans = solve(n, m);
      }
    }
    int to = 0;
    forn(i,n){
      forn(j,m){
        to += ans[i][j];
      }
    }
    cout << to << el;
    forn(i,n){
      forn(j,m){
        cout << ans[i][j];
      }
      cout << el;
    }
    
  }
}