#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) ((int)a.size())
#ifdef Doludu
template <typename T>
ostream& operator << (ostream &o, vector <T> vec) {
    o << "{"; int f = 0;
    for (T i : vec) o << (f++ ? " " : "") << i;
    return o << "}";
}
void bug__(int c, auto ...a) {
    cerr << "\e[1;" << c << "m";
    (..., (cerr << a << " "));
    cerr << "\e[0m" << endl;
}
#define bug_(c, x...) bug__(c, __LINE__, "[" + string(#x) + "]", x)
#define bug(x...) bug_(32, x)
#define bugv(x...) bug_(36, vector(x))
#define safe bug_(33, "safe")
#else
#define bug(x...) void(0)
#define bugv(x...) void(0)
#define safe void(0)
#endif
const int mod = 998244353, N = 1000005;

int add(int a, int b) { a += b; if (a >= mod) a -= mod; return a; }
int sub(int a, int b) { a -= b; if (a < 0) a += mod; return a; }
int mul(int a, int b) { return 1ll * a * b % mod; }
int Pow(int a, int b) { int ans = 1; for (; b; b >>= 1, a = mul(a, a)) if (b & 1) ans = mul(ans, a); return ans; }

int val[11][N];

void build() {
    for (int i = 1; i < N; ++i) {
        int now = 1;
        for (int k = 0; k <= 10; ++k) {
            val[k][i] = now;
            now = mul(now, i);
        }
    }
    for (int k = 1; k <= 10; ++k) {
        for (int i = 1; i < N; ++i) {
            for (int j = i + i; j < N; j += i) {
                val[k][j] = sub(val[k][j], val[k][i]);
            }
        }
        for (int i = 1; i < N; ++i) val[k][i] = add(val[k][i], val[k][i - 1]);
    }
}

void solve() {
    int n, m, k;
    cin >> n >> m >> k;
    int ans = 0;
    for (int l = 1; l <= m; ) {
        int now = m / l;
        int r = m / now + 1;
        ans = add(ans, mul(Pow(now, n), sub(val[k][r - 1], val[k][l - 1])));
        l = r;
    }
    cout << ans << "\n";
}

int main() {
    ios::sync_with_stdio(false), cin.tie(0);
    build();
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
}