from sys import stdin
prime=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97]
M,Q=map(int,stdin.readline().split())
def factorize(N):
	vec=[]
	for i in range(0,M):
		if N%prime[i]!=0:
			continue
		count=0
		while N%prime[i]==0:
			N//=prime[i]
			count+=1
		vec.append((prime[i],count))
	return vec
mod=998244353
inv=[0]*61
inv[1]=1
for i in range(2,61):
	inv[i]=mod-inv[mod%i]*(mod//i)%mod
for i in range(Q):
	N,S=map(int,stdin.readline().split())
	vec=factorize(N)
	ans=1
	for p in vec:
		data=[0]*(p[1]+1)
		data[0]=1
		for j in range(1,p[1]+1):
			data[j]=data[j-1]*p[0]%mod
		res=data[p[1]]
		mem=1
		for j in range(1,p[1]+1):
			mem*=(S-2+j)%mod*inv[j]%mod
			mem%=mod
			res+=data[p[1]-j]*mem%mod
			res%=mod
		ans*=res
		ans%=mod
	ans*=S%mod
	ans%=mod
	print(ans)