#include<bits/stdc++.h>
using namespace std;
using ll=long long;
constexpr int MOD=998244353;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,l,r) for(int i=(l);i<(int)(r);i++)
#define all(v) v.begin(),v.end()

constexpr int MAX_A=100005;

namespace Lib{
  struct mod_fac{
    vector <ll> fac,inv,invf;
    mod_fac (int n):
      fac(n),inv(n),invf(n){
      fac[0]=fac[1]=1;
      inv[0]=inv[1]=1;
      invf[0]=invf[1]=1;
      for(int i=2;i<n;i++){
        fac[i]=fac[i-1]*i%MOD;
        inv[i]=inv[MOD%i]*(MOD-MOD/i)%MOD;
        invf[i]=invf[i-1]*inv[i]%MOD;
      }
    }
    ll comb(int n,int r){
      return fac[n]*invf[r]%MOD*invf[n-r]%MOD;
    }
    ll perm(int n,int r){
      return fac[n]*invf[n-r]%MOD;
    }
  };
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int primes[MAX_A];
  iota(primes,primes+MAX_A,0);
  for(ll i=2;i<MAX_A;i++){
    if(primes[i]!=i)continue;
    for(ll j=i*2;j<MAX_A;j+=i){
      if(primes[j]>i)primes[j]=i;
    }
  }
  int Q;
  cin>>Q;
  Lib::mod_fac F(20*MAX_A);
  int cntp=0;
  rep(i,Q){
    int A,B;
    cin>>A>>B;
    while(A>1){
      cntp+=1;
      A/=primes[A];
    }
    if(cntp>=B){
      cout<<F.comb(cntp-1,B-1)<<'\n';
    }else{
      cout<<"0\n";
    }
  }
}