#include <bits/stdc++.h>
#include <atcoder/modint>

using namespace std;
using namespace atcoder;

using mint = modint998244353;

mint factorial[1600000];

void init_factorial() {
    factorial[0] = 1;

    for (int i = 1; i < 1600000; i++) {
        factorial[i] = factorial[i - 1] * i;
    }
}


mint comb(int n, int r) {
    if (n < r) {
        return mint(0);
    }

    return factorial[n] / (factorial[r] * factorial[n - r]);
}


int count_prime(int n) {
    int count = 0;

    while (n % 2 == 0) {
        n /= 2;
        count++;
    }

    for (int i = 3; i * i <= n; i += 2) {
        while (n % i == 0) {
            n /= i;
            count++;
        }
    }

    if (n > 1) {
        count++;
    }

    return count;
}

int main() {
    init_factorial();

    int Q;
    cin >> Q;

    int count = 0;

    while (Q--) {
        int A, B;
        cin >> A >> B;

        count += count_prime(A);

        cout << comb(count - 1, B - 1).val() << endl;
    }
}