#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include using namespace std; using uint = unsigned int; using ll = long long; using ull = unsigned long long; using pii = pair; using pll = pair; template using vec = vector; template using vvec = vector>; #define rep(i, n) for (int i = 0; i < (n); i++) #define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--) #define all(x) begin(x), end(x) constexpr char ln = '\n'; template inline int SZ(const Container& v) { return int(v.size()); } template inline void UNIQUE(vector& v) { v.erase(unique(v.begin(), v.end()), v.end()); } template inline bool chmax(T1& a, T2 b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(T1& a, T2 b) { if (a > b) { a = b; return true; } return false; } inline int topbit(ull x) { return x == 0 ? -1 : 63 - __builtin_clzll(x); } inline int botbit(ull x) { return x == 0 ? 64 : __builtin_ctzll(x); } inline int popcount(ull x) { return __builtin_popcountll(x); } inline int kthbit(ull x, int k) { return (x >> k) & 1; } inline constexpr long long TEN(int x) { return x == 0 ? 1 : TEN(x - 1) * 10; } const string YESNO[2] = {"NO", "YES"}; const string YesNo[2] = {"No", "Yes"}; inline void YES(bool t = true) { cout << YESNO[t] << "\n"; } inline void Yes(bool t = true) { cout << YesNo[t] << "\n"; } template inline void drop(T x) { cout << x << "\n"; exit(0); } inline void print() { cout << "\n"; } template inline void print(const vector& v) { for (auto it = v.begin(); it != v.end(); ++it) { if (it != v.begin()) { cout << " "; } cout << *it; } print(); } template inline void print(const T& x, const Args& ... args) { cout << x << " "; print(args...); } #ifdef MINATO_LOCAL template ostream& operator<<(ostream& os, pair p) { return os << "(" << p.first << ", " << p.second << ")"; } template void debug_tuple(ostream& os, TUPLE _) { (void)os; (void)_; } template void debug_tuple(ostream &os, TUPLE t) { os << (N == 0 ? "" : ", ") << get(t); debug_tuple(os, t); } template ostream& operator<<(ostream& os, tuple t) { os << "("; debug_tuple<0, tuple, Args...>(os, t); return os << ")"; } string debug_delim(int& i) { return i++ == 0 ? "" : ", "; } #define debug_embrace(x) { int i = 0; os << "{"; { x } return os << "}"; } template ostream& operator<<(ostream& os, vector v) { debug_embrace( for (T e : v) { os << debug_delim(i) << e; } ) } template ostream& operator<<(ostream& os, array a) { debug_embrace( for (T e : a) { os << debug_delim(i) << e; } ) } template enable_if_t>, ostream>& operator<<(ostream& os, T(&a)[N]) { debug_embrace( for (T e : a) { os << debug_delim(i) << e; } ) } template ostream& operator<<(ostream& os, set s) { debug_embrace( for (Key e : s) { os << debug_delim(i) << e; }) } template ostream& operator<<(ostream& os, map mp) { debug_embrace( for (auto e : mp) { os << debug_delim(i) << e; }) } template ostream& operator<<(ostream& os, multiset s) { debug_embrace( for (Key e : s) { os << debug_delim(i) << e; }) } template ostream& operator<<(ostream& os, queue q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.front(); } ) } template ostream& operator<<(ostream& os, deque q) { debug_embrace( for (T e : q) { os << debug_delim(i) << e; } ) } template ostream& operator<<(ostream& os, priority_queue q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.top(); } ) } template ostream& operator<<(ostream& os, priority_queue, greater> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.top(); } ) } void debug_out() { cerr << endl; } template void debug_out(const T& x, const Args& ... args) { cerr << " " << x; debug_out(args...); } #define debug(...) cerr << __LINE__ << " : [" << #__VA_ARGS__ << "] =", debug_out(__VA_ARGS__) #else #define debug(...) (void(0)) #endif struct fast_ios { fast_ios() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); cerr << fixed << setprecision(7); }; } fast_ios_; /////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// #include using namespace atcoder; // //using mint = modint998244353; // //using mint = modint1000000007; // //using mint = modint; // // istream& operator>>(istream& is, modint998244353& M) { long long x; is >> x; M = x; return is; } // ostream& operator<<(ostream& os, const modint998244353& M) { return os << M.val(); } // istream& operator>>(istream& is, modint1000000007& M) { long long x; is >> x; M = x; return is; } // ostream& operator<<(ostream& os, const modint1000000007& M) { return os << M.val(); } // template istream& operator>>(istream& is, static_modint& M) { long long x; is >> x; M = x; return is; } // template ostream& operator<<(ostream& os, const static_modint& M) { return os << M.val(); } // istream& operator>>(istream& is, modint& M) { long long x; is >> x; M = x; return is; } // ostream& operator<<(ostream& os, const modint& M) { return os << M.val(); } // // //vector multiply(vector a, vector b) { return convolution(a,b); } //O(NloglogN) struct PrimeFactorTable { public: PrimeFactorTable() {} PrimeFactorTable(int n) : n_(n), table(n + 1) { iota(table.begin(), table.end(), 0); for (int i = 2; i * i <= n; i++) { if (table[i] == i) { for (int j = i * i; j <= n; j += i) { if (table[j] == j) table[j] = i; } } } } int operator[](int x) const { return table[x]; } vector> prime_factor(int x) const { assert(1 <= x and x <= n_); vector> ret; while (x != 1) { if (ret.empty() or ret.back().first != table[x]) { ret.emplace_back(table[x], 1); } else { ret.back().second++; } x /= table[x]; } return ret; } private: int n_; vector table; }; PrimeFactorTable PFT; void solve() { int x,v; cin >> v >> x; const int P = x * v + 1; vec table(P); vec ans; ans.reserve(x); for (int i = 1; i < P; i++) { if (PFT[i]==i) { table[i] = pow_mod(i,x,P); } else{ int u = PFT[i]; int v = i / u; table[i] = table[u] * table[v] % P; } if (table[i]==1) ans.emplace_back(i); } while (SZ(ans) > x) ans.pop_back(); print(ans); } void naive() { int x,v; cin >> v >> x; for (int i = 1; i <= x*v; i++) { debug(i,pow_mod(i,x,x*v+1)); } } int main() { PFT = PrimeFactorTable(100000); //naive(); int Q; cin >> Q; for (int q = 0; q < Q; q++) { solve(); } }