import heapq 
from heapq import heappop,heappush,heapify
from sys import stdin, setrecursionlimit
input = stdin.readline
readline = stdin.readline
from collections import deque,defaultdict

#N,Q=map(int, input().split())
# N=int(input())
# A=list(map(int, input().split()))
Q=int(input())
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])

    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])

    return arr

D={}


mod=998244353;n=5*10**6
inv_t=[0]+[1]
for i in range(2,n):
  inv_t+=[inv_t[mod%i]*(mod-int(mod/i))%mod]

kai=[1,1]
rev_kai=[1,inv_t[1]]
for i in range(2,n):
  kai.append(kai[-1]*i%mod)
  rev_kai.append(rev_kai[-1]*inv_t[i]%mod)

def cmb(n,r):
  return kai[n]*rev_kai[r]*rev_kai[n-r]%mod

D={};p=0
for i in range(Q):
  a,b=map(int, input().split())
  if a not in D:
    A=factorization(a) 
    c=0
    for _,y in A:
      c+=y 
    D[a]=c 
  p+=D[a]
  if p<b:
    print(0)
  else:
    print(cmb(p-1,b-1))