#include #include #include using namespace std; typedef unsigned long long _ulong; typedef int lint; typedef long double ld; typedef pair plint; typedef pair pld; #define ALL(x) (x).begin(), (x).end() #define SZ(x) ((lint)(x).size()) #define FOR(i, begin, end) for(lint i=(begin),i##_end_=(end);i=i##_begin_;--i) #define REP(i, n) FOR(i,0,n) #define IREP(i, n) IFOR(i,0,n) #define endk '\n' #define fi first #define se second struct fast_ios { fast_ios() { cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_; template auto add = [](T a, T b) -> T { return a + b; }; template auto f_max = [](T a, T b) -> T { return max(a, b); }; template auto f_min = [](T a, T b) -> T { return min(a, b); }; template using V = vector; using Vl = V; using VVl = V; template< typename T > ostream& operator<<(ostream& os, const vector< T >& v) { for (int i = 0; i < (int)v.size(); i++) os << v[i] << (i + 1 != v.size() ? " " : ""); return os; } template< typename T >istream& operator>>(istream& is, vector< T >& v) { for (T& in : v) is >> in; return is; } template bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; } template bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; } lint gcd(lint a, lint b) { if (b == 0) return a; else return gcd(b, a % b); } lint ceil(lint a, lint b) { return (a + b - 1) / b; } lint digit(lint a) { return (lint)log10(a); } lint e_dist(plint a, plint b) { return abs(a.fi - b.fi) * abs(a.fi - b.fi) + abs(a.se - b.se) * abs(a.se - b.se); } lint m_dist(plint a, plint b) { return abs(a.fi - b.fi) + abs(a.se - b.se); } bool check_overflow(lint a, lint b, lint limit) { return a > limit / b; } // a * b > c => true void Worshall_Floyd(VVl& g) { REP(k, SZ(g)) REP(i, SZ(g)) REP(j, SZ(g)) chmin(g[i][j], g[i][k] + g[k][j]); } const lint MOD1000000007 = 1000000007, MOD998244353 = 998244353, INF = 1e9; lint dx[8] = { 1, 0, -1, 0, 1, -1, 1, -1 }, dy[8] = { 0, 1, 0, -1, -1, -1, 1, 1 }; bool YN(bool flag) { cout << (flag ? "YES" : "NO") << endk; return flag; } bool yn(bool flag) { cout << (flag ? "Yes" : "No") << endk; return flag; } struct Edge { lint from, to; lint cost; Edge() { } Edge(lint u, lint v, lint c) { cost = c; from = u; to = v; } bool operator<(const Edge& e) const { return cost < e.cost; } }; struct WeightedEdge { lint to; lint cost; WeightedEdge(lint v, lint c = 1) { to = v; cost = c; } bool operator<(const WeightedEdge& e) const { return cost < e.cost; } }; using WeightedGraph = V>; typedef pair tlint; typedef pair qlint; typedef pair valchar; map< int64_t, int > prime_factor(int64_t n) { map< int64_t, int > ret; for (int64_t i = 2; i * i <= n; i++) { while (n % i == 0) { ret[i]++; n /= i; } } if (n != 1) ret[n] = 1; return ret; } lint mod_pow(lint A, lint B, lint mod) { lint ret = 1; while (B > 0) { if (B & 1) { (ret *= A); ret %= mod; } (A *= A); A %= mod; B >>= 1; } return ret; } lint T, A, B; int main() { cin >> T; while (T--) { cin >> A >> B; lint P = A * B + 1; auto ps = prime_factor(A * B); lint minroot; FOR(i, 2, P) { bool flag = true; for (plint v : ps) { lint _v = i; if (mod_pow(i, (P - 1) / v.first, A * B + 1) == 1) flag = false; } if (flag) { minroot = i; break; } } Vl arr; REP(i, B) { arr.push_back(mod_pow(minroot, i * A, A * B + 1)); } sort(ALL(arr)); cout << arr << endk; } }