#include<bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#include"debug.h"
#else
#define debug(...) void()
#endif
#define all(x) (x).begin(),(x).end()
template<class T>
auto ary(T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
using ll=long long;
using ull=unsigned long long;
const int N=2e6+10;
int mod;
ll qpow(ll x,ll y=mod-2,ll ans=1){
	for(;y;(x*=x)%=mod,y>>=1)if(y&1)(ans*=x)%=mod;
	return ans;
}
int fac[N],ifac[N];
int C(int n,int m){
	if(0>m||m>n)return 0;
	return 1ll*fac[n]*ifac[m]%mod*ifac[n-m]%mod;
}
void init(int n){
	for(int i=fac[0]=1;i<=n;i++)fac[i]=1ll*fac[i-1]*i%mod;
	ifac[n]=qpow(fac[n]);
	for(int i=n;i>=1;i--)ifac[i-1]=1ll*ifac[i]*i%mod;
}
int calc(int x,int y){
	return (C(x+y,x)-C(x+y,x+1)+mod)%mod;
}
int T,n,A,B,b[N],w[N];
ll a[N];
void get(){
	scanf("%d%d%d%d%d",&n,&mod,&b[0],&A,&B),init(n+n);
	for(int i=1;i<=n+n;i++)b[i]=(1ll*A*b[i-1]+B)%mod;
	for(int i=1;i<=n+n;i++)a[i]=a[i-1]+b[i]+1;
	fill(w,w+1+n+n,0);
	for(int i=0,cur=0;i<=n;i++){
		(w[2*i]+=cur)%=mod,(w[2*i+1]+=cur)%=mod;
		cur=(cur+1ll*calc(i,i)*calc(n-i-1,n-i-1))%mod;
	}
	// debug(ary(w,1,n+n),ary(a,1,n+n));
	int ans=0;
	for(int i=1;i<=n+n;i++){
		ans=(ans+a[i]%mod*(mod-w[n+n+1-i]+w[i]))%mod;
	}
	ans=ans*qpow(calc(n,n))%mod;
	printf("%d\n",ans);
}
int main(){
	for(scanf("%d",&T);T--;)get();
	return 0;
}
#ifdef DEBUG
#include"debug.hpp"
#endif