#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using pq_ = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(int)(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}

#include <atcoder/modint>
using mint = atcoder::modint998244353;

using F = array<array<mint, 4>, 4>;


F e(){
    F tmp;
    rep(i, 0, 4) rep(j, 0, 4) tmp[i][j] = 0;
    return tmp;
}
F mul(F l, F r){
    F res = e();
    rep(i, 0, 4) rep(j, 0, 4) rep(k, 0, 4){
        res[i][k] += l[i][j] * r[j][k];
    }
    return res;
}
F my_pow(F l, int t){
    F res = e();
    rep(i, 0, 4) res[i][i] = 1;
    while (t){
        if (t & 1) res = mul(res, l);
        l = mul(l, l);
        t /= 2;
    }
    return res;
}


void solve();
// DEAR MYSTERIES / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    const int L = 10'000'100;
    vector<int> E(L, 1), X(L);
    E[0] = 0, E[1] = 0;
    rep(i, 2, L) if (E[i] == 1){
        for (int j = i * 2; j < L; j += i) E[j] = 0;
    }
    rep(i, 0, L - 10) if (E[i] == 1){
        if (E[i ^ 2] == 1 && (i & 2) == 2){
            X[i] = 1;
        }
    }
    auto Es = E;
    rep(i, 0, L - 1) X[i + 1] += X[i], Es[i + 1] += Es[i];
    int T;
    cin >> T;
    while (T--){
        int N, M;
        cin >> N >> M;
        if (N == 1){
            cout << Es[M] << "\n";
        }
        else{
            F dp = e();
            rep(i, 1, 4) rep(j, 1, 4) if (i != j){
                dp[i][j ^ i] = 1;
                if (i == 1) dp[i][j ^ i] = X[M];
            }
            dp = my_pow(dp, N - 1);
            mint ans = 0;
            rep(i, 1, 4) rep(j, 1, 4){
                if (i == 1) ans += dp[i][j];
                else ans += dp[i][j] * X[M];
            }
            cout << ans.val() << "\n";
        }
    }
}

/*
 * P[i] != 2 であるものは高々 1 つしか存在しない
 * P[0] , P[1] のいずれかは 2 以下である
 */