MOD = 998244353
INFTY = 2*(10**6)
F = [1]*(INFTY+1)
for i in range(2,INFTY+1):
    F[i] = (F[i-1]*i)%MOD
G = [1]*(INFTY+1)
G[INFTY] = pow(F[INFTY],MOD-2,MOD)
for i in range(INFTY-1,0,-1):
    G[i] = (G[i+1]*(i+1))%MOD
def comb(n,k):
    if n<0 or k<0 or n<k:return 0
    return (F[n]*G[k]*G[n-k])%MOD
P = list(range(10**5+1))
for i in range(2,10**5+1):
    if i*i>10**5:
        break
    for j in range(i*i,10**5+1,i):
        P[j] = P[i]
Q = int(input())
cnt = 0
for _ in range(Q):
    a,b = map(int,input().split())
    y = a
    C = {}
    while y>1:
        C[P[y]] = C.get(P[y],0)+1
        y //= P[y]
    for z in C:
        cnt += C[z]
    print(comb(cnt-1,b-1))