#include<bits/stdc++.h>
using namespace std;
#define FF first
#define SS second
#define PB push_back
#define MP make_pair
#define foreach(it,s) for(__typeof((s).begin()) it=(s).begin();it!=(s).end();it++)
#ifndef LOCAL
#define cerr if(0)cout
#endif
typedef long long ll;
const int mod = 1e9+7;
ll qpow(ll x, ll k) {return k==0? 1: 1ll*qpow(1ll*x*x%mod,k>>1)*(k&1?x:1)%mod;}
const int maxk = 11;
typedef unsigned long long ull;
int k1, k2;
int ifac[maxk], fac[maxk], s2[maxk][maxk];
struct node
{
	int x[maxk], y[maxk], S[maxk][maxk];
	node()
	{
		memset(x, 0, sizeof(x));
		memset(y, 0, sizeof(y));
		x[0] = y[0] = 1;
		memset(S, 0, sizeof(S));
	}
	node operator + (const node &t)
	{
		node ret;
		for (int i=0; i<=k1; i++)
		{
			ull sum = 0;
			for (int j=0; j<=i; j++) sum += 1ll*x[j]*t.x[i-j];
			ret.x[i] = sum%mod;
		}
		for (int i=0; i<=k2; i++)
		{
			ull sum = 0;
			for (int j=0; j<=i; j++) sum += 1ll*y[j]*t.y[i-j];
			ret.y[i] = sum%mod;
		}
		int tmp[maxk][maxk] = {};
		for (int i=0; i<=k1; i++)
		{
			for (int j=0; j<=k2; j++)
			{
				ull sum = 0;
				for (int k=0; k<=j; k++)
				{
					sum += 1ll*y[k]*t.S[i][j-k];
				}
				tmp[i][j] = sum%mod;
			}
		}
		for (int i=0; i<=k1; i++)
		{
			for (int j=0; j<=k2; j++)
			{
				ull sum = 0;
				for (int k=0; k<=i; k++)
				{
					sum += 1ll*x[k]*tmp[i-k][j];
				}
				ret.S[i][j] = (S[i][j]+sum)%mod;
			}
		}
		return ret;
	}
	ll query()
	{
		ll ret = 0;
		for (int i=0; i<=k1; i++) for (int j=0; j<=k2; j++)
		{
			ret = (ret+1ll*S[i][j]*s2[k1][i]%mod*s2[k2][j]%mod*fac[i]%mod*fac[j])%mod;
		}
		return ret;
	}
}NU, NR;
node qsum(node x, int k) {return k==0?node():(k&1?qsum(x+x, k>>1)+x:qsum(x+x, k>>1));}
void prework()
{
	fac[0] = 1;
	for (int i=1; i<maxk; i++) fac[i] = 1ll*fac[i-1]*i%mod;
	for (int i=0; i<maxk; i++) ifac[i] = qpow(fac[i], mod-2);
	s2[0][0] = 1;
	for (int i=1; i<maxk; i++) for (int j=1; j<=i; j++) s2[i][j] = (s2[i-1][j-1]+1ll*j*s2[i-1][j])%mod;
	NR.x[0] = NR.x[1] = 1;
	NR.y[0] = 1;
	NR.S[0][0] = NR.S[1][0] = 1;
	NU.x[0] = 1;
	NU.y[0] = NU.y[1] = 1;
}
node solve(ll n, ll a, ll b, ll c, node A, node B)
{
	assert(n>=0); assert(a>=0); assert(b>=0); assert(c>=0);
	b %= c;
	if (n==0) return node();
	if (a>=c) return solve(n, a%c, b, c, A, qsum(A, a/c)+B);
	ll m = (a*n+b)/c;
	if (m==0) return qsum(B, n);
	ll cnt = n-(m*c-b-1)/a;
	return qsum(B, (c-b-1)/a)+A+solve(m-1, c, -b-1+c, a, B, A)+qsum(B, cnt);
}
int main()
{
	prework();
	int Tn;
	cin>>Tn;
	while (Tn--)
	{
		ll n, a, b, c;
		cin>>n>>a>>b>>c>>k1>>k2;
		node cur = qsum(NU, b/c)+solve(n, a, b, c, NU, NR);
		ll ans = cur.query();
		if (k1==0) ans = (ans+qpow(b/c, k2))%mod;
		cout<<(ans+mod)%mod<<endl;
	}
	return 0;
}
/*#include<bits/stdc++.h>
using namespace std;
#define FF first
#define SS second
#define PB push_back
#define MP make_pair
#define foreach(it,s) for(__typeof((s).begin()) it=(s).begin();it!=(s).end();it++)
#ifndef LOCAL
#define cerr if(0)cout
#endif
typedef long long ll;
const int mod = 1e9+7;
ll qpow(ll x, ll k) {return k==0? 1: 1ll*qpow(1ll*x*x%mod,k>>1)*(k&1?x:1)%mod;}
const int maxk = 11;
typedef unsigned long long ull;
int k1, k2;
int ifac[maxk], fac[maxk], s2[maxk][maxk];
struct node
{
	int x[maxk], y[maxk], S[maxk][maxk];
	node()
	{
		memset(x, 0, sizeof(x));
		memset(y, 0, sizeof(y));
		x[0] = y[0] = 1;
		memset(S, 0, sizeof(S));
	}
	node operator + (const node &t)
	{
		node ret;
		for (int i=0; i<=k1; i++)
		{
			ull sum = 0;
			for (int j=0; j<=i; j++) sum += 1ll*x[j]*t.x[i-j];
			ret.x[i] = sum%mod;
		}
		for (int i=0; i<=k2; i++)
		{
			ull sum = 0;
			for (int j=0; j<=i; j++) sum += 1ll*y[j]*t.y[i-j];
			ret.y[i] = sum%mod;
		}
		int tmp[maxk][maxk] = {};
		for (int i=0; i<=k1; i++)
		{
			for (int j=0; j<=k2; j++)
			{
				ull sum = 0;
				for (int k=0; k<=j; k++)
				{
					sum += 1ll*y[k]*t.S[i][j-k];
				}
				tmp[i][j] = sum%mod;
			}
		}
		for (int i=0; i<=k1; i++)
		{
			for (int j=0; j<=k2; j++)
			{
				ull sum = 0;
				for (int k=0; k<=i; k++)
				{
					sum += 1ll*x[k]*tmp[i-k][j];
				}
				ret.S[i][j] = (S[i][j]+sum)%mod;
			}
		}
		return ret;
	}
	ll query()
	{
		ll ret = 0;
		for (int i=0; i<=k1; i++) for (int j=0; j<=k2; j++)
		{
			ret = (ret+1ll*S[i][j]*s2[k1][i]%mod*s2[k2][j]%mod*fac[i]%mod*fac[j])%mod;
		}
		return ret;
	}
}NU, NR;
node qsum(node x, int k) {return k==0?node():(k&1?qsum(x+x, k>>1)+x:qsum(x+x, k>>1));}
void prework()
{
	fac[0] = 1;
	for (int i=1; i<maxk; i++) fac[i] = 1ll*fac[i-1]*i%mod;
	for (int i=0; i<maxk; i++) ifac[i] = qpow(fac[i], mod-2);
	s2[0][0] = 1;
	for (int i=1; i<maxk; i++) for (int j=1; j<=i; j++) s2[i][j] = (s2[i-1][j-1]+1ll*j*s2[i-1][j])%mod;
	NR.x[0] = NR.x[1] = 1;
	NR.y[0] = 1;R);
		ll ans = cur.query();
		if (k1==0) ans = (ans+qpow(b/c, k2))%mod;
		cout<<(ans+mod)%mod<<endl;
	}
	return 0;
}*/