#include<bits/stdc++.h>
using namespace std;
const int N=11,P=1e9+7;
int C[N][N],k1,k2;
struct node
{
	int a[N][N];
	long long c1,c2;
}A,B;
#define clr(x) memset(&x,0,sizeof(x))
inline node operator+(const node&A,const node&B)
{
	node C=A;C.c1+=B.c1,C.c2+=B.c2;
	static int pa[N],pb[N];
	for(int a=0;a<=k1;++a)
		for(int b=0;b<=k2;++b)
		{
			pa[0]=pb[0]=1;
			for(int i=1;i<=a;++i)pa[i]=1ll*pa[i-1]*(A.c1%P)%P;
			for(int i=1;i<=b;++i)pb[i]=1ll*pb[i-1]*(A.c2%P)%P;
			for(int i=0;i<=a;++i)pa[i]=1ll*pa[i]*::C[a][i]%P;
			for(int i=0;i<=b;++i)pb[i]=1ll*pb[i]*::C[b][i]%P;
			for(int i=0;i<=a;++i)
				for(int j=0;j<=b;++j)
				{
					C.a[a][b]=(C.a[a][b]+
							1ll*pa[i]*pb[j]%P*
								B.a[a-i][b-j]
						)%P;
				}
		}
	return C;
}
inline node operator*(node A,long long b)
{
	node ans;clr(ans);
	while(b)
	{
		if(b&1)ans=ans+A;
		A=A+A,b>>=1;
	}
	return ans;
}
node calc(int p,int q,int r,int n,const node&U,const node&R)
{
	long long m=(1ll*p*n+r)/q;if(m==0)return R*n;
	if(p>=q)return calc(p%q,q,r,n,U,U*(p/q)+R);
	return R*((q-r-1)/p)+U+calc(q,p,(q-r-1)%p,m-1,R,U)+R*(n-(m*q-r-1)/p);
}
signed main()
{
	cin.tie(0)->sync_with_stdio(0);
	int T;cin>>T;
	for(int i=0;i<N;++i)
	{
		C[i][0]=1;
		for(int j=1;j<=i;++j)
			C[i][j]=C[i-1][j]+C[i-1][j-1];
	}
	while(T--)
	{
		int n,p,q,r;
		cin>>n>>p>>r>>q>>k2>>k1;
		clr(A);clr(B); 
		A.c1=1;B.c2=1;
		for(int i=0;i<=k2;++i)B.a[0][i]=1;
		node Z;clr(Z);
		Z.c1=r/q;
		int z=1;
		for(int i=0;i<=k1;++i)
			Z.a[i][0]=z,z=1ll*z*Z.c1%P;
		Z=Z+calc(p,q,r%q,n,A,B);
		cout<<Z.a[k1][k2]<<'\n';
	}
}