#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using pii=pair<int,int>;

#define all(a) a.begin(),a.end()
#define pb push_back
#define sz(a) ((int)a.size())

template <int mod>
struct Modint{
    int val;
    Modint(int _val=0){val=_val%mod;if(val<0) val+=mod;}
    Modint(ll _val){val=_val%mod;if(val<0) val+=mod;}
    Modint operator +(const Modint& o) const {
        Modint res;
        res.val=val+o.val;
        if(res.val>=mod) res.val-=mod;
        return res;
    }
    Modint operator +(const int& o) const {return Modint(val+o);}
    Modint operator +(const ll& o) const {return Modint(val+o);}

    Modint operator -() const {
        Modint res;
        res.val=-val;
        if(res.val<0) res.val+=mod;
        return res;
    }
    Modint operator -(const Modint& o) const {
        Modint res;
        res.val=val-o.val;
        if(res.val<0) res.val+=mod;
        return res;
    }
    Modint operator -(const int& o) const {return Modint(val-o);}
    Modint operator -(const ll& o) const {return Modint(val-o);}

    Modint operator *(const Modint& o) const {return ((ll)val)*o.val%mod;}
    Modint operator *(const int& o) const {return Modint((ll(val))*o);}
    Modint operator *(const ll& o) const {return Modint((ll(val))*(o%mod));}

    Modint operator +=(const Modint& o){return *this=(*this)+o;}
    Modint operator -=(const Modint& o){return *this=(*this)-o;}
    Modint operator *=(const Modint& o){return *this=(*this)*o;}

    Modint Pow(ll b) const {Modint res(1); for(Modint tmp(val); b; tmp*=tmp,b>>=1) if(b&1) res*=tmp; return res;}
    Modint Pow(const Modint& a, ll b) const {return a.Pow(b);}

    inline Modint inv() const {return (*this).Pow(mod-2);}
    Modint operator /(const Modint& o) const {return *this*o.inv();}
    Modint operator /(const ll& o) const {return *this*Modint(o).inv();}
    bool operator ==(const Modint& o) const {return val==o.val;}
    bool operator !=(const Modint& o) const {return val!=o.val;}
};
template<int mod>
ostream& operator << (ostream& o, Modint<mod> x){return o << x.val;}
template<int mod>
Modint<mod> operator +(const int& x, const Modint<mod>& y){return Modint<mod>(x+y.val);}
template<int mod>
Modint<mod> operator +(const ll& x, const Modint<mod>& y){return Modint<mod>(x+y.val);}
template<int mod>
Modint<mod> operator -(const int& x, const Modint<mod>& y){return Modint<mod>(x-y.val);}
template<int mod>
Modint<mod> operator -(const ll& x, const Modint<mod>& y){return Modint<mod>(x-y.val);}
template<int mod>
Modint<mod> operator *(const int& x, const Modint<mod>& y){return Modint<mod>(x*y.val);}
template<int mod>
Modint<mod> operator *(const ll& x, const Modint<mod>& y){return Modint<mod>(x%mod*y.val);}

const int MOD=998244353;
using modint=Modint<MOD>;
vector<modint> inv,fac,invfac;
void init_comb(int N){
    inv.resize(N),fac.resize(N),invfac.resize(N);
    inv[1]=1,fac[0]=1,invfac[0]=1;
    for(int i=2; i<N; ++i) inv[i]=inv[MOD%i]*(MOD-MOD/i);
    for(int i=1; i<N; ++i) fac[i]=fac[i-1]*i;
    for(int i=1; i<N; ++i) invfac[i]=invfac[i-1]*inv[i];
}
inline modint C(int n, int m){return m>n||m<0?modint(0):fac[n]*invfac[m]*invfac[n-m];}

template<typename T, int N>
struct matrix: array<array<T,N>,N>{
    matrix(){for(int i=0; i<N; ++i) for(int j=0; j<N; ++j) (*this)[i][j]=0;}
    void out(){
        for(int i=0; i<N; ++i){
            for(int j=0; j<N; ++j) cout << (*this)[i][j] << ' ';
            cout << "\n";
        }
    }
    constexpr matrix id(){
        matrix res;
        for(int i=0; i<N; ++i) res[i][i]=1;
        return res;
    }
    matrix operator +(const matrix &mat2){
        matrix res;
        for(int i=0; i<N; ++i) for(int j=0; j<N; ++j) res[i][j]=(*this)[i][j]+mat2[i][j];
        return res;
    }
    matrix operator -(const matrix &mat2){
        matrix res;
        for(int i=0; i<N; ++i) for(int j=0; j<N; ++j) res[i][j]=(*this)[i][j]-mat2[i][j];
        return res;
    }
    matrix operator *(const matrix &mat2){
        matrix res;
        for(int i=0; i<N; ++i) for(int j=0; j<N; ++j) for(int k=0; k<N; ++k) res[i][j]+=(*this)[i][k]*mat2[k][j];
        return res;
    }
    matrix operator ^(ll x){
        assert(x>=0);
        matrix res=id(),cur=*this;
        for(; x; cur=cur*cur,x>>=1) if(x&1) res=res*cur;
        return res;
    }
};
template<typename T, int N>
ostream& operator << (ostream& o, matrix<T,N> x){
    for(int i=0; i<N; ++i){
        for(int j=0; j<N; ++j) o << x[i][j] << ' ';
        o << "\n";
    }
    return o;
}

const int N=10000005;
modint dp[N];
ll n,m;

void ahcorz(){
    cin >> n >> m;
    if(n>m) swap(n,m);
    int res=0;
    if(n==0){
        cout << "1\n";
    }
    else if(n==m&&false){
        cout << dp[n]*(n+1)*dp[n]*(n+1)+dp[n-1]*dp[n-1]*n*n*n << "\n";
    }
    else{
        //z=x*n+y*(2*n+1)
        matrix<modint,2> mat;
        mat[1][0]=1,mat[1][1]=0;
        mat[0][0]=2*n+1,mat[0][1]=n;
        mat=mat^(m-n);
        modint x=mat[1][0]*dp[n]+mat[1][1]*dp[n-1];
        modint y=mat[0][0]*dp[n]+mat[0][1]*dp[n-1];
        modint res=0;
        res+=y*dp[n-1]*n*2;
        res+=x*dp[n-1]*n;
        if(n>1) res+=y*dp[n-2]*(n-1);
        cout << res << "\n";
    }
}

signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    dp[0]=1,dp[1]=2;
    for(int i=2; i<N; ++i){
        dp[i]=dp[i-1]*i*2+dp[i-2]*(i-1);
    }
    int t; cin >> t;
    while(t--) ahcorz();
}