import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


long power(long a, long e, long m) {
  long x = a % m, y = 1 % m;
  for (; e; e >>= 1) {
    if (e & 1) y = (y * x) % m;
    x = (x * x) % m;
  }
  return y;
}

enum LIM = 1000 * 100 + 10;

void main() {
  auto lpf = iota(LIM).array;
  foreach (p; 2 .. LIM) {
    if (lpf[p] == p) {
      for (int n = 2 * p; n < LIM; n += p) {
        chmin(lpf[n], p);
      }
    }
  }
  
  try {
    for (; ; ) {
      const numCases = readInt();
      foreach (caseId; 0 .. numCases) {
        const V = readLong();
        const X = readLong();
        const P = V * X + 1;
        
        long[] qs;
        for (long a = P - 1; a > 1; ) {
          const q = lpf[cast(int)(a)];
          do {
            a /= q;
          } while (a % q == 0);
          qs ~= q;
        }
        
        long G;
        for (G = 1; ; ++G) {
          bool ok = true;
          foreach (q; qs) {
            if (power(G, (P - 1) / q, P) == 1) {
              ok = false;
              break;
            }
          }
          if (ok) {
            break;
          }
        }
        
        auto ans = new long[cast(int)(X)];
        foreach (i; 0 .. X) {
          ans[cast(int)(i)] = power(G, (P - 1) / X * i, P);
        }
        ans.sort;
        
        foreach (i; 0 .. X) {
          if (i > 0) write(" ");
          write(ans[cast(int)(i)]);
        }
        writeln;
      }
    }
  } catch (EOFException e) {
  }
}