CF1699B.Almost Ternary Matrix

You are given two even integers $n$ and $m$. Your task is to find any binary matrix $a$ with $n$ rows and $m$ columns where every cell $(i,j)$ has exactly two neighbours with a different value than $a_{i,j}$.

Two cells in the matrix are considered neighbours if and only if they share a side. More formally, the neighbours of cell $(x,y)$ are: $(x-1,y)$, $(x,y+1)$, $(x+1,y)$ and $(x,y-1)$.

It can be proven that under the given constraints, an answer always exists.

给你两个偶数 $n$ 和 $m$。你的任务是构造任意一个大小为 $n$ 行 $m$ 列的 0-1 矩阵 $a$，使得每个单元格 $(i,j)$ 恰好有两个相邻单元格的值与 $a_{i,j}$ 不同。

矩阵中两个单元格被认为是相邻的，当且仅当它们共享一条边。更准确地说，单元格 $(x,y)$ 的相邻单元格为：$(x-1,y)$、$(x,y+1)$、$(x+1,y)$ 和 $(x,y-1)$。

在给定约束下，可以证明答案一定存在。

Each test contains multiple test cases. The first line of input contains a single integer $t$ ($1 \le t \le 100$) — the number of test cases. The following lines contain the descriptions of the test cases.

The only line of each test case contains two even integers $n$ and $m$ ($2 \le n,m \le 50$) — the height and width of the binary matrix, respectively.

每个测试包含多个测试用例。输入的第一行包含一个整数 $t$（$1 \le t \le 100$）—— 测试用例的数量。接下来的各行包含各测试用例的描述。

每个测试用例仅一行，包含两个偶数 $n$ 和 $m$（$2 \le n,m \le 50$）—— 分别表示二进制矩阵的高度和宽度。

For each test case, print $n$ lines, each of which contains $m$ numbers, equal to $0$ or $1$ — any binary matrix which satisfies the constraints described in the statement.

It can be proven that under the given constraints, an answer always exists.

对于每个测试用例，输出 $n$ 行，每行包含 $m$ 个数字（均为 $0$ 或 $1$），即任意一个满足题目描述中约束条件的二进制矩阵。

可以证明，在给定约束条件下，答案一定存在。

White means $0$, black means $1$.

The binary matrix from the first test case

The binary matrix from the second test case

The binary matrix from the third test case

白色表示 $0$，黑色表示 $1$。

第一个测试用例的二进制矩阵

第二个测试用例的二进制矩阵

第三个测试用例的二进制矩阵