#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;

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);
        }
      }
    }
  }else if(n%4){
    int cnt1 = 0;
    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);
        }
        cnt1 += g[i][j];
      }
    }
    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);
        }
        cnt1 -= g2[i][j];
      }
    }

    if(cnt1 < 0) return g2;
  }else{
    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!=1);
        }else if(i%4==2){
          g[i][j] = (j%4!=2);
        }else if(i%4==3){
          g[i][j] = (j%4!=0);
        }
      }
    }
  }
  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){
      if(n%4){
        ans = solve(n, m);
      }else if(m%4){
        ans = solve(m, n);
        ans = transpose(ans);
      }else{
        ans = solve(n,m);
      }
    }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;
    }
    
  }
}