Not Sitting(不坐)

Rahul and Tina are looking forward to starting their new year at college. As they enter their new classroom, they observe the seats of students are arranged in a n×m grid. The seat in row r and column c is denoted by (r, c), and the distance between two seats (a,b)and (c,d) is |a-c| + |b-d|.

As the class president, Tina has access to exactly kk buckets of pink paint. The following process occurs.

First, Tina chooses exactly k seats in the classroom to paint with pink paint. One bucket of paint can paint exactly one seat.
After Tina has painted k seats in the previous step, Rahul chooses where he sits. He will not choose a seat that has been painted pink due to his hatred of the colour pink.
After Rahul has chosen his seat, Tina chooses a seat for herself. She can choose any of the seats, painted or not, other than the one chosen by Rahul.
Rahul wants to choose a seat such that he sits as close to Tina as possible. However, Tina wants to sit as far away from Rahul as possible due to some complicated relationship history that we couldn’t fit into the statement!

Now, Rahul wonders for k=0,1,…,n⋅m−1, if Tina has k buckets of paint, how close can Rahul sit to Tina, if both Rahul and Tina are aware of each other’s intentions and they both act as strategically as possible? Please help satisfy Rahul’s curiosity!
Input
The input consists of multiple test cases. The first line contains an integer t (1≤t≤5⋅10 ^4) — the number of test cases. The description of the test cases follows.

The first line of each test case contains two integers n, m (2≤n⋅m≤10 ^5 ) — the number of rows and columns of seats in the classroom.

The sum of n⋅m across all test cases does not exceed 10^5.

Output
For each test case, output n⋅m ordered integers — the distance between Rahul and Tina if both of them act optimally for every k∈[0,n⋅m−1].

Example
input
2
4 3
1 2
output
3 3 4 4 4 4 4 4 5 5 5 5
1 1
Note
One possible sequence of choices for the first testcase where Tina has k=3 buckets of paints is as follows.
在第一个测试用例中，Tina有k=3桶油漆，一个可能的选择序列如下。

Tina paints the seats at positions (1,2), (2,2), (3,2) with pink paint. Rahul chooses the seat at (3,1) after which Tina chooses to sit at (1,3).
Tina用粉红色油漆位置(1,2)，(2,2)，(3,2)的座位。Rahul选择(3,1)的位置，蒂娜选择(1,3)的位置。

Therefore, the distance between Tina and Rahul is |3?1|+|1?3|=4, and we can prove that this is indeed the minimum possible distance under the given constraints. There may be other choices of seats which lead to the same answer as well.
因此，Tina与Rahul之间的距离为|3?1|+|1?3|=4，我们可以证明这确实是给定约束条件下可能的最小距离。可能还有其他的座位选择，也会得到相同的答案。

For k=0 in the first test case, Rahul can decide to sit at (2,2) and Tina can decide to sit at (4,3) so the distance between them would be |2?4|+|2?3|=3.
对于k=0，在第一个测试样例中，Rahul可以选择坐在(2,2)，Tina可以选择坐在(4,3)。所以他们之间的距离是|2 - 4|+|2 - 3|=3。

Below are pictorial representations of the k=3 and k=0 cases for the first test case .

A possible seating arrangement for k=3.

A possible seating arrangement for k=0.
翻译
拉胡尔和蒂娜期待着在大学开始新的一年。当他们进入新教室时，他们观察到学生的座位以n×m的网格排列。r行和c列中的座位用（r，c）表示，两个座位（a，b）和（c，d）之间的距离为| a-c |+| b-d |。

作为班长，蒂娜可以接触到整整kk桶的粉红色油漆。发生以下过程。

首先，蒂娜选择了教室里的k个座位，用粉红色油漆。一桶油漆正好能油漆一个座位。

蒂娜在上一步画完k座后，拉胡尔选择了他坐的地方。他不会选择漆成粉红色的座位，因为他讨厌粉红色。

拉胡尔选好座位后，蒂娜为自己选了一个座位。除了拉胡尔选的座位外，她可以选择任何一个座位，不管是否涂漆。

拉胡尔想选择一个座位，让他坐得尽可能靠近蒂娜。然而，蒂娜想坐在离拉胡尔尽可能远的地方，因为一些复杂的关系史，我们无法融入到声明中！

现在，Rahul想知道k=0,1，…，n⋅ M−1、如果蒂娜有k桶油漆，如果拉胡尔和蒂娜都知道对方的意图，并且都尽可能从战略上行动，那么拉胡尔能和蒂娜坐得多近？请帮助满足Rahul的好奇心！

思路
开始Rahul 不知道Tina的位置，所以为了在任意情况下都最近，他会选择更加靠近中间的位置，而刷油漆的位置也会优先选择靠中间的位置；
所以当Tina开始选位置时，Rahul已经坐在了能坐的位置中最靠近中间的地方，而Tina自然就会选择最远离Rahul的角落。
因为两人都是最优解，且油漆也会优先涂在靠中间的位置确保距离可以加大。所以随着k的增大，两人的距离会越来越远。

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll t,n,m,i,j,p,f;
int main()
{
	cin>>t;
	while(t--){
		priority_queue<int,vector<int>,greater<int> >q;
		cin>>n>>m;
		for(i=0;i<n;i++){
			for(j=0;j<m;j++){
				p=max(i,n-i-1)+max(j,m-j-1);
				q.push(p);
			}
		}
		f=0;
		while(q.size()){
			f++;
			if(f!=1) cout<<" ";
			cout<<q.top();
			q.pop(); 
		}
		cout<<endl;
	}
}