//misaka, hitori, and elaina will carry me to red

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#include <iostream>
#include <cmath>
#include <utility>
#include <cassert>
#include <algorithm>
#include <vector>
#include <array>
#include <cstdio>
#include <cstring>
#include <functional>
#include <numeric>
#include <set>
#include <queue>
#include <map>
#include <chrono>
#include <random>

#define sz(x) ((int)(x.size()))
#define all(x) x.begin(), x.end()
#define pb push_back
#define eb emplace_back
#define kill(x, s) {if(x){ cout << s << "\n"; return ; }}

#ifndef LOCAL
#define cerr while(0) cerr
#endif

using ll = long long;
using lb = long double;

const lb eps = 1e-9;
const ll mod = 1e9 + 7, ll_max = 1e18;
//const ll mod = (1 << (23)) * 119 +1, ll_max = 1e18;
const int MX = 2e5 +10, int_max = 0x3f3f3f3f;

struct {
  template<class T>
  operator T() {
    T x; std::cin >> x; return x;
  }
} in;

using namespace std;


string pattern[] = {"1110", "0111", "1101", "1011"};
string pattern2[] = {"111", "101", "111", "010"};
void solve(){
	int n = in, m = in;
	vector<string> ans(n);
	if(n<4 && m<4){
		for(int i = 0; i<n; i++){
			for(int j = 0; j<m; j++){
				ans[i].pb('1');
			}
		}
	}else if(n == 3){
		for(int i = 0; i<m; i++){
			for(int j = 0; j<3; j++){
				ans[j].pb(pattern2[i%4][j]);
			}
		}
	}else if (m == 3){
		for(int i = 0; i<n; i++){
			for(int j = 0; j<3; j++){
				ans[i].pb(pattern2[i%4][j]);
			}
		}
	}else if(n%4 == 2 || (n%4 == 3 && (m%4 == 1)) || (n%4 == 0 && m%2 == 1)){
		for(int i = 0; i<n; i++){
			for(int j = 0; j<m; j++){
				ans[i].pb(pattern[j%4][i%4]);
			}
		}
	}else{
		for(int i = 0; i<n; i++){
			for(int j = 0; j<m; j++){
				ans[i].pb(pattern[i%4][j%4]);
			}
		}
	}
	int oup = 0;
	for(int i = 0; i<n; i++){
		for(int j = 0; j<m; j++){
			oup += ans[i][j] == '1';
		}
	}
	cout << oup << "\n";
	for(string s : ans) cout << s << "\n";
}

signed main(){
  cin.tie(0) -> sync_with_stdio(0);

  int T = 1;
	cin >> T;
  for(int i = 1; i<=T; i++){
		//cout << "Case #" << i << ": ";
		solve();
	}
  return 0;
}