Problem: A mad scientist Dr.Jubal has made a competitive programming task. Try to solve it!

You are given integers n,k. Construct a grid A with size n × n consisting of integers 0 and 1. The very important condition should be satisfied: the sum of all elements in the grid is exactly k. In other words, the number of 1 in the grid is equal to k.

Let's define:

  * A_{i,j} as the integer in the i-th row and the j-th column. 
  * R_i = A_{i,1}+A_{i,2}+...+A_{i,n} (for all 1 ≤ i ≤ n). 
  * C_j = A_{1,j}+A_{2,j}+...+A_{n,j} (for all 1 ≤ j ≤ n). 
  * In other words, R_i are row sums and C_j are column sums of the grid A. 
  * For the grid A let's define the value f(A) = (max(R)-min(R))^2 + (max(C)-min(C))^2 (here for an integer sequence X we define max(X) as the maximum value in X and min(X) as the minimum value in X). 



Find any grid A, which satisfies the following condition. Among such grids find any, for which the value f(A) is the minimum possible. Among such tables, you can find any.

Input

The input consists of multiple test cases. The first line contains a single integer t (1 ≤ t ≤ 100) — the number of test cases. Next t lines contain descriptions of test cases.

For each test case the only line contains two integers n, k (1 ≤ n ≤ 300, 0 ≤ k ≤ n^2).

It is guaranteed that the sum of n^2 for all test cases does not exceed 10^5.

Output

For each test case, firstly print the minimum possible value of f(A) among all tables, for which the condition is satisfied.

After that, print n lines contain n characters each. The j-th character in the i-th line should be equal to A_{i,j}.

If there are multiple answers you can print any.

Example

Input


4
2 2
3 8
1 0
4 16


Output


0
10
01
2
111
111
101
0
0
0
1111
1111
1111
1111

Note

In the first test case, the sum of all elements in the grid is equal to 2, so the condition is satisfied. R_1 = 1, R_2 = 1 and C_1 = 1, C_2 = 1. Then, f(A) = (1-1)^2 + (1-1)^2 = 0, which is the minimum possible value of f(A).

In the second test case, the sum of all elements in the grid is equal to 8, so the condition is satisfied. R_1 = 3, R_2 = 3, R_3 = 2 and C_1 = 3, C_2 = 2, C_3 = 3. Then, f(A) = (3-2)^2 + (3-2)^2 = 2. It can be proven, that it is the minimum possible value of f(A).

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using std::cin;
using std::cout;
using std::deque;
using std::endl;
using std::map;
using std::max;
using std::min;
using std::set;
using std::string;
using std::swap;
using std::vector;
const int MOD = 998244353;
const int inf = 1000000000;
const int N = 100005;
long long power(const long long& x, const long long& mi) {
  long long s1 = 1LL, s2 = x, m = mi;
  while (m) {
    if (m & 1) s1 = s1 * s2 % MOD;
    s2 = s2 * s2 % MOD;
    m >>= 1;
  }
  return s1;
}
long long r[1005], c[1005];
struct node {
  int x, id;
};
bool operator>(node x, node y) { return x.x > y.x; }
bool operator<(node x, node y) { return x.x < y.x; }
std::priority_queue<node> heap;
int a[1005][1005];
int n, K;
void solve() {
  cin >> n >> K;
  long long mnc = inf, mxc = -inf, mnr = inf, mxr = -inf;
  for (int i = 1; i <= n; ++i) {
    r[i] = K / n + (i <= K % n);
    mxr = max(mxr, r[i]);
    mnr = min(mnr, r[i]);
    c[i] = K / n + (i <= K % n);
    mxc = max(mxc, c[i]);
    mnc = min(mnc, c[i]);
  }
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j) a[i][j] = 0;
  for (int i = 1; i <= n; ++i) {
    int x = 1;
    for (int j = i; x <= r[i]; j = j % n + 1, ++x) {
      a[i][j] = 1;
    }
  }
  cout << (mxr - mnr) * (mxr - mnr) + (mxc - mnc) * (mxc - mnc) << endl;
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      printf("%d", a[i][j]);
    }
    puts("");
  }
  return;
}
int main() {
  int T = 1;
  cin >> T;
  while (T--) solve();
  return 0;
}