// created:  2024-10-12 08:55:42
#include<cstdio>
#include<cctype>
#include<algorithm>
#define F(i,l,r) for(int i=l,i##_end=r;i<i##_end;++i)
#define I128 //||is_same<T,__int128_t>::value||is_same<T,__uint128_t>::value
using namespace std;
template<typename T>enable_if_t<is_integral<T>::value I128,void> readmain(T &x)
{
	bool neg=false;int c=getchar();
	for(;!isdigit(c);c=getchar())if(c=='-')neg=true;
	for(x=0;isdigit(c);c=getchar())x=(T)(10*x+(c-'0'));
	if(neg)x=-x;
}
template<typename T>T& read(T &x){readmain(x);return x;}
template<typename T,typename ...Tr>void read(T &x,Tr&... r){readmain(x);read(r...);}
typedef __uint128_t u128;
typedef unsigned long long ull;
constexpr int N=2e6+5;int mod;
void reduce(int &x){if(x>=mod)x-=mod;}
struct barrett
{
	ull mod,inv;
	void init(int mod_){mod=mod_;inv=(-1ull)/mod+1ull;}
	int operator()(ull x)
	{
		x-=(ull)((u128)x*inv>>64)*mod;
		if(x>>63)x+=mod;
		return (int)x;
	}
}bar;
int qpow(int a,int b,int c=1)
{
	for(;b;b>>=1,a=bar((ull)a*a))if(b&1)c=bar((ull)c*a);
	return c;
}
int fac[N],invfac[N];
int n,a[N],cat[N];
void gen()
{
	int b0,ca,cb,sa=0;
	read(b0,ca,cb);
	F(i,0,n)
	{
		b0=bar((ull)ca*b0+cb);
		reduce(sa+=b0+1);
		a[i]=sa;
	}
}
void initfac()
{
	F(i,fac[0]=1,n+1)fac[i]=bar((ull)fac[i-1]*i);
	invfac[n]=qpow(fac[n],mod-2);
	for(int i=n;i;--i)invfac[i-1]=bar((ull)invfac[i]*i);
}
void solve()
{
	read(n,mod);
	bar.init(mod);
	n<<=1;
	gen();initfac();
	n>>=1;
	F(i,0,n+1)cat[i]=bar((ull)bar((ull)fac[2*i]*invfac[i])*invfac[i+1]);
	int ans=0,tot=cat[n];
	int ho=tot;
	F(i,0,n)
	{
		if(i&1)ho=bar(ho+(ull)(mod-cat[i>>1])*cat[n-1-(i>>1)]);
		ans=bar(ans+(tot+2ull*(mod-ho))*(a[i]+mod-a[2*n-1-i]));
	}
	ans=bar((ull)ans*invfac[2*n]);
	ans=bar((ull)ans*fac[n]);ans=bar((ull)ans*fac[n+1]);
	printf("%d\n",ans);
}
int main()
{
	int tt;
	read(tt);
	while(tt--)solve();
	return 0;
}