#include <bits/stdc++.h>

using namespace std;
#define int long long
const int p=998244353;
int po(int a,int b) {if(b==0) return 1; if(b==1) return a; if(b%2==0) {int u=po(a,b/2);return (u*u)%p;} else {int u=po(a,b-1);return (a*u)%p;}}
int inv(int x) {return po(x,p-2);}
const int maxn=4e5+5;
int fact[maxn];int invf[maxn];
int c(int n,int k)
{
    if(k>n) return 0;
    int ans=fact[n];ans*=invf[k];ans%=p;ans*=invf[n-k];ans%=p;return ans;
}
const int sq=700;
vector<pair<int,int> > h[maxn/sq];
int res[maxn];
int32_t main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    fact[0]=1;for(int i=1;i<maxn;++i) {fact[i]=(fact[i-1]*i)%p;}
    for(int i=0;i<maxn;++i) {invf[i]=inv(fact[i]);}
    vector<pair<int,int> > que;
    int t;cin>>t;
    for(int cyc=0;cyc<t;++cyc)
    {
        int n,m;cin>>n>>m;
        h[(n+sq-1)/sq].push_back({m,cyc});
        que.push_back({n,m});
    }
    for(int i=1;i<=200005/sq+1;++i)
    {
        sort(h[i].begin(),h[i].end());
        int cur=0;int x=0;
        int r=0;
        while(cur!=h[i].size())
        {
            while(x!=h[i][cur].first)
            {
                r+=c(2*x,i*sq-1);r%=p;
                ++x;
            }
            res[h[i][cur].second]=r;
            ++cur;
        }
    }
    for(int i=0;i<que.size();++i)
    {
        auto [n,m]=que[i];
        int n1=((n+sq-1)/sq)*sq;
        int r=res[i];
        while(n1>n)
        {
            r=(-2*r+(c(2*m,n1)));r%=p;
            --n1;
        }
        cout<<(r%p+p)%p<<'\n';
    }
    return 0;
}