#include<set>
#include<map>
#include<queue>
#include<ctime>
#include<cstdio>
#include<vector>
#include<cstring>
#include<cassert>
#include<algorithm>
#define fi first
#define se second
#define ep emplace
#define ll long long
#define eb emplace_back
#define pii pair<int,int>
#define rg(x) x.begin(),x.end()
#define pc(x) __builtin_popcount(x)
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define FIO(FILE) freopen(FILE".in","r",stdin),freopen(FILE".out","w",stdout)
using namespace std;
bool __st;
inline int read(){
    char c=getchar();int f=1,x=0;
    for(;c<48||c>57;c=getchar())if(c=='-') f=-1;
    for(;47<c&&c<58;c=getchar()) x=(x<<3)+(x<<1)+(c^48);
    return x*f;
}
const int N=2e5+10,V=2e5+5,B=400,mod=998244353,iv=(mod+1)/2;
int m;ll fac[N],inv[N],ans[N],s;
struct node{
    int l,r,id;
    friend bool operator<(node a,node b){
        int x=a.l/B,y=b.l/B;
        return x!=y?x<y:a.r<b.r;
    }
}q[N];
ll qp(ll a,ll b){ll r=1;for(;b;b>>=1,a=a*a%mod)if(b&1)r=r*a%mod;return r;}
ll C(int n,int m){return fac[n]*inv[m]%mod*inv[n-m]%mod;}
void misaka(){
    m=read();
    rep(i,1,m){
        int n=read(),m=read();
        ans[i]=qp(2,n)-1;
        q[i]={m-1,n-1,i};
    }
    sort(q+1,q+m+1);
    fac[0]=1;
    rep(i,1,V) fac[i]=fac[i-1]*i%mod;
    inv[V]=qp(fac[V],mod-2);
    per(i,V-1,0) inv[i]=inv[i+1]*(i+1)%mod;
    int l=0,r=0;s=1;
    rep(i,1,m){
        while(r<q[i].r){
            s=(s*2-C(r,l)+mod)%mod;
            r++;
        }
        while(l>q[i].l){
            s=(s-C(r,l)+mod)%mod;
            l--;
        }
        while(r>q[i].r){
            s=(s+C(r-1,l))*iv%mod;
            r--;
        }
        while(l<q[i].l){
            s=(s+C(r,l+1))%mod;
            l++;
        }
        // debug("%d %d %d\n",l,r,s);
        (ans[q[i].id]*=s)%=mod;
    }
    rep(i,1,m) printf("%lld\n",ans[i]);
}
bool __ed;
signed main(){
    #ifdef LOCAL_MSK
    atexit([](){
    debug("\n%.3lfs  ",(double)clock()/CLOCKS_PER_SEC);
    debug("%.3lfMB\n",abs(&__st-&__ed)/1024./1024);});
    #endif
    
    int T=1;
    while(T--) misaka();
    return 0;
}