#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(v) v.begin(),v.end()
#define dbg(x) cerr << #x << ": " << (x) << endl;
struct Comb {
    int n;
    ll mod;
    vector<ll>fac,inv,finv;
    Comb(int n, ll mod) : n(n), mod(mod), fac(n+1), inv(n+1), finv(n+1) {
        fac[0] = fac[1] = inv[1] = finv[0] = finv[1] = 1;
        for (int i = 2; i <= n; ++i) {
            fac[i] = fac[i-1] * i % mod;
            inv[i] = mod - inv[mod%i] * (mod/i) % mod;
            finv[i] = finv[i-1] * inv[i] % mod;
        }
    }
    ll c(int n, int k) {
        if (n < k || k < 0) return 0;
        return fac[n] * finv[n-k] % mod * finv[k] % mod;
    }
};
int Q;
int main() {
    ll mod = 998244353;
    cin >> Q;

    vector<int>A(Q),B(Q),cnt(Q);
    for (int i = 0; i < Q; ++i) {
        cin >> A[i] >> B[i];

        for (int j = 2; j*j <= A[i]; ++j) {
            while (A[i] % j == 0) {
                cnt[i]++;
                A[i] /= j;
            }
            if (A[i] == 1) break;
        }
        if (A[i] > 1) ++cnt[i];
        // cerr << cnt[i] << " \n"[i==Q-1];
    }
    int max = accumulate(ALL(cnt),0) + *max_element(ALL(B));
    Comb cb(max, mod);
    int terms = 0;
    for (int i = 0; i < Q; ++i) {
        terms += cnt[i];
        // dbg(terms)
        cout << cb.c(terms - 1, B[i]-1) << '\n';
    }
}