#include <bits/stdc++.h>
using namespace std;

long long modpow(long long b, long long x, long long mod) {
  long long res = 1;
  while (x) {
    if (x & 1) (res *= b) %= mod;
    (b *= b) %= mod;
    x >>= 1;
  }
  return res;
}

int x, v;

int main() {
  int t;
  cin >> t;
  while (t--) {
    cin >> v >> x;
    int cnt = 0;
    int pr = v * x + 1;
    for (int i = 1; cnt < x; ++i)
      if (modpow(i, x, pr) == 1) cout << i << " \n"[++cnt == x];
  }
  return 0;
}