#include<cstdio>
#include<vector>
#include<queue>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<ctime>
#include<random>
#include<assert.h>
#define pb emplace_back
#define mp make_pair
#define fi first
#define se second
#define dbg(x) cerr<<"In Line "<< __LINE__<<" the "<<#x<<" = "<<x<<'\n'
#define dpi(x,y) cerr<<"In Line "<<__LINE__<<" the "<<#x<<" = "<<x<<" ; "<<"the "<<#y<<" = "<<y<<'\n'
#define DE(fmt,...) fprintf(stderr, "Line %d : " fmt "\n",__LINE__,##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef __int128 i128;
typedef unsigned long long ull;
typedef pair<int,int>pii;
typedef pair<ll,int>pli;
typedef pair<ll,ll>pll;
typedef pair<int,ll>pil;
typedef vector<int>vi;
typedef vector<ll>vll;
typedef vector<pii>vpii;
typedef vector<pll>vpll;
template<typename T>T cmax(T &x, T y){return x=x>y?x:y;}
template<typename T>T cmin(T &x, T y){return x=x<y?x:y;}
template<typename T>
T &read(T &r){
	r=0;bool w=0;char ch=getchar();
	while(ch<'0'||ch>'9')w=ch=='-'?1:0,ch=getchar();
	while(ch>='0'&&ch<='9')r=r*10+(ch^48),ch=getchar();
	return r=w?-r:r;
}
template<typename T1,typename... T2>
void read(T1 &x,T2& ...y){read(x);read(y...);}
const int mod=998244353;
inline void cadd(int &x,int y){x=(x+y>=mod)?(x+y-mod):(x+y);}
inline void cdel(int &x,int y){x=(x-y<0)?(x-y+mod):(x-y);}
inline int add(int x,int y){return (x+y>=mod)?(x+y-mod):(x+y);}
inline int del(int x,int y){return (x-y<0)?(x-y+mod):(x-y);}
int qpow(int x,int y){
	int s=1;
	while(y){
		if(y&1)s=1ll*s*x%mod;
		x=1ll*x*x%mod;
		y>>=1;
	}
	return s;
}
struct ele{
	int a[3][3];
	void mem(){memset(a,0,sizeof(a));}
	ele operator*(const ele y){
		ele z;z.mem();
		for(int i=0;i<3;i++)
			for(int j=0;j<3;j++)
				for(int k=0;k<3;k++)
					cadd(z.a[i][k],1ll*a[i][j]*y.a[j][k]%mod);
		return z;
	}
}I({1,0,0,0,1,0,0,0,1});
ele qpow(ele x,ll y){
	ele s=I;
	while(y){
		if(y&1)s=s*x;
		x=x*x;
		y>>=1; 
	}
	return s;
}
ele solve(ll n,ll a,ll b,ll c,ele U,ele R){
	if(n<=0)return I;
	if(a>=c)return solve(n,a%c,b,c,U,qpow(U,a/c)*R);
	ll m=((i128)a*n+b)/c;
	if(!m)return qpow(R,n);
	return qpow(R,(c-b-1)/a)*U*solve(m-1,c,(c-b-1)%a,a,R,U)*qpow(R,n-(c*m-b-1)/a);
}
void solve(){
	i128 a,b;
	read(a,b);
	ele U({1,0,0,1,1,0,1,0,1});
	ele R({1,1,0,0,1,0,0,1,1});
	ele IU({1,0,0,998244352,1,0,998244352,0,1});
	ele IR({1,998244352,0,0,1,0,0,998244352,1});
	ele ans=U*R*solve(b,a,0,b,U,R)*IR*IU;
	cout<<add(1,add(ans.a[2][0],ans.a[2][1]))<<'\n';
}
signed main(){
	#ifdef do_while_true
		assert(freopen("data.in","r",stdin));
//		assert(freopen("data.out","w",stdout));
	#endif
	int T;read(T);
	while(T--)solve();
    #ifdef do_while_true
//		cerr<<'\n'<<"Time:"<<1.0*clock()/CLOCKS_PER_SEC*1000<<" ms"<<'\n';
	#endif
	return 0;
}