import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
######################################################################


mod = 998244353
nn = 10 ** 6
fact = [1] * nn
for i in range(nn - 1):
    fact[i + 1] = fact[i] * (i + 1) % mod
invfact = [1] * nn
invfact[nn - 1] = pow(fact[nn - 1], mod - 2, mod)
for i in range(nn - 1)[::-1]:
    invfact[i] = invfact[i + 1] * (i + 1) % mod
 
def binom(x, y):
    if x < 0 or y < 0 or x - y < 0:
        return 0
    return fact[x] * invfact[y] % mod * invfact[x - y] % mod


N = 10 ** 5 + 10
A = [0] * N

for i in range(2, N):
    if A[i] == 0:
        for j in range(i, N, i):
            A[j] = i

def fast_prime_factorization(n):
    res = 0
    while n > 1:
        res += 1
        n //= A[n]
    return res


n = ni()
m = 0
for i in range(n):
    a, b = na()
    m += fast_prime_factorization(a)
    #print(m, b)
    print(binom(m - 1, b-1))