#include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll maxn=200005;
const ll mod=998244353;
ll s[maxn+5],p[maxn+5];
ll ksm(ll a,ll b){
    ll ans,i,j,k;
    ans=1;
    while(b){
        if(b&1)
            ans=ans*a%mod;
        a=a*a%mod;
        b>>=1;
    }
    return ans;
}
ll cal(ll n,ll m){
    ll zc,zc1,i,j,k;
    if(m<0 or m>n)
        return 0;
    if(m==0 or m==n)
        return 1;
    if(m>n/2)
        m=n-m;
    zc=1,zc1=1;
    for(i=1;i<=m;i++){
        zc=zc*(n-i+1)%mod;
        zc1=zc1*i%mod;
    }
    return zc*ksm(zc1,mod-2)%mod;
}
ll luc(ll n,ll m){
    ll i,j,k;
    if(m==0)
        return 1;
    return luc(n/mod,m/mod)*cal(n%mod,m%mod)%mod;
}
int main(){
    ll n,m,t,ans,i,j,k;
    scanf("%lld",&t);
    while(t--){
        scanf("%lld%lld",&n,&m);
        ans=luc(n,m);
        printf("%lld\n",ans);
    }
    return 0;
}