#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
template<typename T> inline bool chmax(T &a, T b) { return ((a < b) ? (a = b, true) : (false)); }
template<typename T> inline bool chmin(T &a, T b) { return ((a > b) ? (a = b, true) : (false)); }
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep2(i, m ,n) for (int i = (m); i < (long long)(n); i++)
#define REP(i, n) for (long long i = 1; i < (long long)(n); i++)
typedef long long ll;
#define updiv(N,X) (N + X - 1) / X
#define l(n) n.begin(),n.end()
#define YesNo(Q) Q==1?cout<<"Yes":cout<<"No"
using P = pair<int, int>;
using mint = modint;
const int MOD = 998244353LL;
const ll INF = 999999999999LL;
vector<long long> fact, fact_inv, inv;
/*  init_nCk :二項係数のための前処理
    計算量:O(n)
*/
template <typename T>
void input(vector<T> &v){
 rep(i,v.size()){cin>>v[i];}
  return;
}
void init_nCk(int SIZE) {
    fact.resize(SIZE + 5);
    fact_inv.resize(SIZE + 5);
    inv.resize(SIZE + 5);
    fact[0] = fact[1] = 1;
    fact_inv[0] = fact_inv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < SIZE + 5; i++) {
        fact[i] = fact[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
        fact_inv[i] = fact_inv[i - 1] * inv[i] % MOD;
    }
}
/*  nCk :MODでの二項係数を求める(前処理 int_nCk が必要)
    計算量:O(1)
*/
long long nCk(int n, int k) {
    assert(!(n < k));
    assert(!(n < 0 || k < 0));
    return fact[n] * (fact_inv[k] * fact_inv[n - k] % MOD) % MOD;
}

long long modpow(long long a, long long n, long long mod) {
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

ll POW(ll a,ll n){
  long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a;
        a = a * a;
        n >>= 1;
    }
    return res;
}
vector<mint> rv;

mint f(ll a,ll b,ll c){
	mint sm = 0;
	mint puroddo = modpow(a,b,998244353LL);
	//comb(c-2+(i),(i))
	rep(i,b+1){
		sm += puroddo;//a^(b-i) c-1
	//	cout<<puroddo.val()<<endl;
		puroddo *= (c-2+i+1);
		puroddo *= rv[(i+1)]; 
		puroddo *= rv[a];
		// b-i
//cout<<a<<" "<<i<<" "<<c<<" "<<c-2+b-i<<" "<<b-i<<endl;
	}
	return sm;
}
int main() {
//init_nCk(114514);
rv.resize(200);
 vector<int> 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};
 int sz = prime.size();
 int t;cin>>t;
 REP(i,200){
 	rv[i]=1;
 	rv[i] /= i;
 }
 while(t--){
 	ll n,s;cin>>n>>s;
 	vector<int> prd(sz);mint ans = 1;
 	rep(i,sz){
 		while(n%prime[i]==0){
 			n /= prime[i];
 			prd[i]++;
 		}
 	}
 	
 	rep(i,sz){
 		//	cerr<<(f(prime[i],prd[i],s).val())<<" ";

 		ans *= f(prime[i],prd[i],s);
 	}
 	//cerr<<endl;
 	ans *= s;
 	cout << ans.val() << endl;
 }
}