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

#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define pii pair<int, int>

inline int rd() {
    int x = 0;
    bool f = 0;
    char c = getchar();
    for (; !isdigit(c); c = getchar()) f |= (c == '-');
    for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
    return f ? -x : x;
}

#define N 100007
#define mod 998244353

inline int gcd(int a, int b) {return b ? gcd(b, a % b) : a;}

inline int fpow(int x, int t = mod - 2) {
    int res = 1;
    for (; t; t >>= 1, x = 1ll * x * x % mod)
        if (t & 1) res = 1ll * res * x % mod;
    return res;
}

bool vis[N];

int phi[N] = {0, 1}, prm[N], ans[N];

inline void work() {
    int n = rd(), m = rd();
    for (int i = 1; i <= n; ++i) ans[i] = 0;
    for (int i = 1; i <= n; ++i)
        for (int j = i; j <= n; j += i) 
            ans[j] = (ans[j] + 1ll * gcd(j / i, m) * fpow(m, i - 1) % mod * phi[j / i]) % mod;
    printf("%d", ans[1]);
    for (int i = 2; i <= n; ++i) printf(" %lld", 1ll * ans[i] * fpow(i) % mod); 
    puts("");
}

int main() {
    for (int i = 2; i < N; ++i) {
        if (!vis[i]) {phi[i] = i - 1; prm[++prm[0]] = i;}
        for (int j = 1; j <= prm[0]; ++j) {
            if (1ll * i * prm[j] > N) break;
            vis[i * prm[j]] = 1;
            if (i % prm[j] == 0) {
                phi[i * prm[j]] = phi[i] * prm[j];
                break;
            }
            phi[i * prm[j]] = phi[i] * (prm[j] - 1);
        }
    }
    for (int t = rd(); t; --t) work();
    return 0;
}