#include<bits/stdc++.h>
#define int long long
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
bool st;
using namespace std;
template<typename T>istream&operator>>(istream&I,vector<T>&v){for(auto&i:v)I>>i;return I;}
template<typename T>ostream&operator<<(ostream&O,vector<T> v){for(auto i:v)O<<i<<' ';return O;}
string TMP,STR;
stringstream CIN;
void read_all(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
#ifdef debug
    cerr<<"----------------------------------- START -----------------------------------\n";
    while(getline(cin,TMP))STR+=TMP,STR+='\n';
    CIN.str(STR);
    cerr<<"\n--------------------------------- INPUT END ---------------------------------\n";
#endif
}
#ifdef debug
#define cin CIN
#endif
namespace AC{
const int N=2e5+5,B=447;
const int P=998244353,I=499122177;
int n,ans[N];
int fac[N],inv[N];
struct ques{int m,k,id;}a[N];
bool cmp(ques x,ques y){return x.m/B!=y.m/B?x.m<y.m:x.k<y.k;}
int qp(int x,int y){
    int z=1;
    for(;y;y>>=1,x=1ll*x*x%P)if(y&1)z=1ll*z*x%P;
    return z;
}
void init(){
    const int n=2e5;
    fac[0]=inv[0]=1;
    for(int i=1;i<=n;++i){
        fac[i]=1ll*fac[i-1]*i%P;
        inv[i]=qp(fac[i],P-2);
    }
}
int C(int n,int m){
    if(n<0||m<0||n>m)return 0;
    return 1ll*fac[m]*inv[n]%P*inv[m-n]%P;
}
void add(int &x,int y){
    x+=y;
	if(x>=P)x-=P;
}
void solve(){
    cin>>n;
	init();
    for(int i=1;i<=n;++i){
        cin>>a[i].m>>a[i].k,a[i].id=i;
        --a[i].m,--a[i].k;
    }
    sort(a+1,a+n+1,cmp);
    int m=0,k=0,sum=1;
    for(int i=1;i<=n;++i){
        int M=a[i].m,K=a[i].k;
        while(k<K)++k,add(sum,C(k,m));
        while(k>K)add(sum,P-C(k,m)),k--;
        while(m<M)sum=(sum*2%P+P-C(k,m))%P,++m;
        while(m>M)--m,sum=1ll*I*(sum+C(k,m))%P;
        ans[a[i].id]=1ll*sum*(qp(2,M+1)-1)%P;
    }
    for(int i=1;i<=n;++i)cout<<ans[i]<<'\n';
}
}
bool ed;
signed main(){
    chrono::steady_clock::time_point St=chrono::steady_clock::now();
    read_all();
    chrono::steady_clock::time_point ST=chrono::steady_clock::now();
    int t=1;
    //cin>>t;
    while(t--)AC::solve();
    chrono::steady_clock::time_point ED=chrono::steady_clock::now();
    cerr<<setprecision(3)<<fixed<<"\n\n------------------------------------ END ------------------------------------\n"<<"Total Time   : "<<left<<setw(10)<<chrono::duration_cast<chrono::milliseconds>(ED-St).count()<<" \tms\n"<<"Real  Time   : "<<left<<setw(10)<<chrono::duration_cast<chrono::milliseconds>(ED-ST).count()<<" \tms\n"<<"             : "<<left<<setw(10)<<chrono::duration_cast<chrono::microseconds>(ED-ST).count()<<" \t?s\n\n"<<"Total Memory : "<<left<<setw(10)<<(&ed-&st)/1048576.0<<" \tMB\n"<<"               "<<left<<setw(10)<<(&ed-&st)/1024.0<<" \tKB\n"<<"               "<<left<<setw(10)<<(&ed-&st)<<" \tByte\n";
}