from collections import defaultdict
def prime_divisors(x):
  P=[]
  for p in range(2,int(x**0.5)+1):
    while x%p==0:
      P.append(p)
      x//=p
  if x>1:
    P.append(x)
  return P

MOD=998244353
fact=[1]*(10**6+1)
for i in range(10**6):
    fact[i+1]=fact[i]*(i+1)%MOD
ifact=[1]*(10**6+1)
ifact[10**6]=pow(fact[10**6],MOD-2,MOD)
for i in range(10**6,0,-1):
    ifact[i-1]=ifact[i]*i%MOD

def nCr(n,r):
    if n<r:return 0
    return fact[n]*ifact[n-r]*ifact[r]%MOD

q=int(input())
ab=[list(map(int,input().split())) for _ in range(q)]
prime_cnt=0
x=1
for a,b in ab:
    x*=a
    prime_cnt+=len(prime_divisors(a))
    
    ans=nCr(prime_cnt-b+b-1,b-1)
    print(ans)