#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
using mint=modint998244353;

long long prime[100]={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,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541};

vector<pair<long long,long long>> factorize(long long N,long long M){
    vector<pair<long long,long long>> vec;
    for(long long i=0;i<M;i++){
        long long count=0;
        while(N%prime[i]==0){
            N/=prime[i];
            count++;
        }
        vec.push_back(make_pair(prime[i],count));
    }
    return vec;
}

int main(){
    long long M,Q;
    cin >> M >> Q;
    mint inv[61];
    inv[1]=1;
    for(int i=2;i<61;i++){
        inv[i]=-inv[998244353%i]*mint(998244353/i);
    }
    for(;Q--;){
        long long N,S;
        cin >> N >> S;
        vector<pair<long long,long long>> vec=factorize(N,M);
        mint ans=1;
        for(auto p : vec){
            vector<mint> data(p.second+1);
            data[0]=1;
            for(long long i=1;i<=p.second;i++){
                data[i]=data[i-1]*mint(p.first);
            }
            mint res=data[p.second];
            mint mem=1;
            for(long long i=1;i<=p.second;i++){
                mem*=inv[i]*mint(S-2+i);
                res+=data[p.second-i]*mem;
            }
            ans*=res;
        }
        ans*=mint(S);
        cout << ans.val() << endl;
    }
}