因为要距离已经选定的点尽量远，所以只可能是四个角落的其中一个，枚举就可以了。男生为了距离女生更近一点，所以他应该尽量选择靠近中心的位置，因为靠近中心的位置可以让它距离所有点的距离都尽可能小，因此女生应该先从中心的点开始涂色，女生选择的点越少，最终两人的距离越小，两人都是最优策略，因此答案数组需要从小到大排序。

// Date: Sat Dec  2 17:04:06 2023

#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>

#include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

using namespace std;

const int INF = 0x3f3f3f3f, MOD = 1e9 + 7;
const double eps = 1e-8;
const int dir[8][2] = {
    {0, 1}, {0, -1}, {1, 0}, {-1, 0}, {1, 1}, {1, -1}, {-1, 1}, {-1, -1},
};

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> VI;
typedef pair<int, int> PII;

const ull Pr = 131;

#define For(i, a, b) for (int i = int(a); i < int(b); ++i)
#define Rof(i, a, b) for (int i = int(b) - 1; i >= int(a); --i)
#define For1(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define Rof1(i, a, b) for (int i = int(b); i >= int(a); --i)
#define ForE(i, j) for (int i = h[j]; i != -1; i = ne[i])

#define f1 first
#define f2 second
#define pb push_back
#define has(a, x) (a.find(x) != a.end())
#define nonempty(a) (!a.empty())
#define all(a) (a).begin(), (a).end()
#define SZ(a) int((a).size())

#ifdef _DEBUG
#define debug1(x) cout << #x " = " << x << endl;
#define debug2(x, y) cout << #x " = " << x << " " #y " = " << y << endl;
#define debug3(x, y, z)                                                        \
  cout << #x " = " << x << " " #y " = " << y << " " #z " = " << z << endl;
#else
#define debug1
#define debug2
#define debug3
#endif

int t, n, m;

int main(void) {
#ifdef _DEBUG
  freopen("1627b.in", "r", stdin);
#endif
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);

  cin >> t;

  while (t--) {
    cin >> n >> m;
    vector<PII> corners{
        {1, 1},
        {1, m},
        {n, 1},
        {n, m},
    };

    VI res;

    For1(i, 1, n) {
      For1(j, 1, m) {
        int dis = 0;
        for (auto &[x, y] : corners) {
          int tmp = abs(x - i) + abs(y - j);
          dis = max(dis, tmp);
        }
        res.pb(dis);
      }
    }
    sort(all(res));
    for (auto x : res) {
      cout << x << ' ';
    }
    cout << '\n';
  }

  return 0;
}