#include<bits/stdc++.h>
#define LL long long
#define LLL __int128
#define uint unsigned
#define ldb long double
#define uLL unsigned long long
using namespace std;
const int N=1e7+5,P=998244353;
inline int qpow(int x,int y){
    int z=1;
    for(;y;(y>>=1)&&(x=x*1ll*x%P))
        if(y&1)z=z*1ll*x%P;
    return z;
}
inline LL F(int m,int a,int b){
    if(!a||!b)return 0;
    if(m==1)return 1;
    if(m==2)return 1ll<<__gcd(a,b);
    LL z=1;
    for(LL i=__gcd(a,b);i--;)z*=m;
    return z;
}
int pn,p[N],vp[N];
int pw1[32768],pw2[32768];
inline int pow2(const int&n){
    return 1ll*pw2[n>>15]*pw1[n&32767]%P;
}
inline void init(const int&n){
    pw1[0]=pw2[0]=1;
    for(int i=1;i<32768;++i)(pw1[i]=pw1[i-1]*2)>=P&&(pw1[i]-=P);
    (pw2[1]=pw1[32767]*2)>=P&&(pw2[1]-=P);
    for(int i=2;i<32768;++i)pw2[i]=1ll*pw2[i-1]*pw2[1]%P;
    for(int i=2;i<=n;++i){
        if(!vp[i])vp[i]=i,p[++pn]=i;
        for(int j=1,k;j<=pn&&(k=i*p[j])<=n;++j){
            vp[k]=p[j];if(i%p[j]==0)break;
        }
    }
}
int n,m,ans;
vector<pair<int,int>>D;
inline void solve(int x,int g,int h){
    if(x>=D.size())return ans=(ans+1ll*h*pow2(1ll*n*m/g%(P-1)))%P,void();
    solve(x+1,g,h),solve(x+1,g*=D[x].first,h*=D[x].first-1);
    for(int i=D[x].second-2;i>0;--i)solve(x+1,g*=D[x].first,h*=D[x].first);
}
inline void MAIN(){
    int a,b,c,d;
    cin>>m>>a>>b>>c>>d,D.clear(),ans=0;
    n=(F(m,c,d)-F(m,a,b))/m%P;
    for(int x=m>>__builtin_ctz(m);x>1;){
        int y=vp[x];
        x/=y,D.emplace_back(y,1);
        while(x%y==0)x/=y,++D.back().second;
    }
    solve(0,1,1),cout<<1ll*ans*qpow(m,P-2)%P<<'\n';
}
signed main(){
    cin.tie(0)->sync_with_stdio(0);
#define LOCAL
#ifndef LOCAL
    freopen("calculate.in","r",stdin);
    freopen("calculate.out","w",stdout);
#endif
    init(1e7);
    int t=1;cin>>t;while(t--)MAIN();
    return 0;
}
/*
*/