#include <iostream>
#include <cassert>
#include <queue>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <random>
#include <ctime>
#include <map>
#include <set>
using namespace std;
// #define int long long
#define pii pair<int, int>
#define eb emplace_back
#define F first
#define S second
#define test(x) cout << "Test: " << x << '\n'
#define lowbit(x) (x & -x)
#define debug puts("qwq");
#define open(x) freopen(#x".in", "r", stdin);freopen(#x".out", "w", stdout);
#define close fclose(stdin);fclose(stdout);
namespace FastIO {
	template <typename T = int>
	inline T read() {
		T s = 0, w = 1;
		char c = getchar();
		while (!isdigit(c)) {
			if (c == '-') w = -1;
			c = getchar();
		}
		while (isdigit(c)) s = (s << 1) + (s << 3) + (c ^ 48), c = getchar();
		return s * w;
	}
	template <typename T>
	inline void read(T &s) {
		s = 0;
		int w = 1;
		char c = getchar();
		while (!isdigit(c)) {
			if (c == '-') w = -1;
			c = getchar();
		}
		while (isdigit(c)) s = (s << 1) + (s << 3) + (c ^ 48), c = getchar();
		s = s * w;
	}
	template <typename T, typename... Arp> inline void read(T &x, Arp &...arp) {
		read(x), read(arp...);
	}
	template <typename T>
	inline void write(T x, char ch = '\n') {
		if (x < 0) x = -x, putchar('-');
		static char stk[25];
		int top = 0;
		do {
			stk[top++] = x % 10 + '0', x /= 10;
		} while (x);
		while (top) putchar(stk[--top]);
		putchar(ch);
		return;
	}
	template <typename T>
	inline void smax(T &x, T y) {
		if (x < y) x = y;
	}
	template <typename T>
	inline void smin(T &x, T y) {
		if (x > y) x = y;
	}
	void quit() {
		exit(0);
	}
} using namespace FastIO;
const int N = 1e6 + 19;
int prime[N], isprime[N], len, phi[N], have[N];
void init() {
	phi[1] = 1;
	for (int i = 2; i < N; ++i) {
		if (!isprime[i]) prime[++len] = i, phi[i] = i-1;
		for (int j = 1; j <= len && i * prime[j] < N; ++j) {
			isprime[i * prime[j]] = 1;
			if (i % prime[j] == 0) {
				phi[i * prime[j]] = phi[i] * prime[j];
				break;
			}
			phi[i * prime[j]] = phi[i] * (prime[j] - 1);
		}
	}
	have[2] = have[4] = 1;
	for (int i = 1; i <= len; ++i) {
		for (long long j = prime[i]; j < N; j *= prime[i]) {
			have[j] = 1;
			if (j * 2 < N) have[j * 2] = 1;
		} 
	}
}
vector<int> devider;
void devide(int n) {
	devider.clear();
	for (int i = 2; i * i <= n; ++i) {
		if (n % i == 0) {
			while (n % i == 0) n /= i;
			devider.eb(i);
		}
	}
	if (n > 1) devider.eb(n);
}
int ksm(int a, int b, int p) {
	int res = 1;
	while (b) {
		if (b & 1) res = 1LL * res * a % p;
		a = 1LL * a * a % p; b >>= 1;
	} return res;
}
signed main() {
	init(); // test(phi[20]);
	int t = read();
	while (t--) {
		int n, d; read(n, d);
		if (!have[n]) {
			puts("0\n");
			continue;
		}
		int mn = 1;
		devide(phi[n]);
		for (; ; ++mn) {
			int s = 1;
			if (__gcd(mn, n) ^ 1) continue;
			for (const int i : devider) {
				if (ksm(mn, phi[n] / i, n) == 1) {
					s = 0; break;
				}
			} if (s) break;
		} vector<int> ans; write(phi[phi[n]]);
		for (int i = 1, pw = 1; (int)ans.size() < phi[phi[n]]; i++) {
			pw = 1LL * mn * pw % n;
			if (__gcd(i, phi[n]) == 1) ans.eb(pw);
		}
		for (int i = d-1; i < (int)ans.size(); i += d) write(ans[i], ' ');
		puts("");
	}
	return 0;
}