// MagicDark
#include <bits/stdc++.h>
#define int long long
#define debug cerr << "\33[32m[" << __LINE__ << "]\33[m "
#define SZ(x) ((int) x.size() - 1)
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> T& chkmax(T &x, T y) {return x = max(x, y);}
template <typename T> T& chkmin(T &x, T y) {return x = min(x, y);}
template <typename T> T& read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = - f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	return x *= f;
}
const int N = 2e6 + 10;
int n, MOD, b[N], a[N], A, B, p[N], s[N];
inline int& add(int &x, ll y) {return x = (x + y) % MOD;}
int fac[N], ifac[N], inv[N];
inline void binom(int x) {
	fac[0] = ifac[0] = inv[1] = 1;
	F(i, 2, x) inv[i] = (ll) (MOD - MOD / i) * inv[MOD % i] % MOD;
	F(i, 1, x) fac[i] = (ll) fac[i - 1] * i % MOD, ifac[i] = (ll) ifac[i - 1] * inv[i] % MOD;
}
inline int C(int x, int y) {return x < y || y < 0 ? 0 : (ll) fac[x] * ifac[y] % MOD * ifac[x - y] % MOD;}
inline int power(int x, int y = MOD - 2) {
	int ans = 1;
	for (; y; x = (ll) x * x % MOD, y >>= 1)
		if (y & 1) ans = (ll) ans * x % MOD;
	return ans;
}
void zhk() {
	read(n), read(MOD), read(b[0]), read(A), read(B);
	binom(2 * n + 5);
	p[0] = 1;
	F(i, 1, n) p[i] = (C(i * 2, i) - C(i * 2, i - 1) + MOD) % MOD;
	F(i, 1, n) s[i] = (s[i - 1] + (ll) p[i - 1] * p[n - i]) % MOD;
	int ans = 0;
	F(i, 1, n * 2) {
		b[i] = ((ll) A * b[i - 1] + B) % MOD;
		a[i] = (a[i - 1] + b[i] + 1) % MOD;
		// debug << a[i] << " " << b[i] << endl;
		if (i <= n) {
			ll t = s[i / 2];
			// debug << i << ' ' << t << endl;
			add(ans, (ll) t * a[i]);
			add(ans, (ll) (p[n] - t + MOD) % MOD * (MOD - a[i]));
		} else {
			ll t = s[(2 * n - i + 1) / 2];
			// debug << i << ' ' << t << endl;
			// debug << (2 * n - i) / 2 << " " << t << endl;
			add(ans, (ll) t * (MOD - a[i]));
			add(ans, (ll) (p[n] - t + MOD) % MOD * a[i]);
		}
	}
	// debug << n << " " << p[n] << endl;
	cout << (ll) ans * power(p[n]) % MOD << '\n';
}
signed main() {
	int _ = 1;
	cin >> _;
	while (_--) zhk();
	return 0;
}
/* why?
*/