#include<bits/stdc++.h>
using namespace std;
namespace my_std{
	#define ll long long
	#define bl bool
	ll my_pow(ll a,ll b,ll mod){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res=(res*a)%mod;
			a=(a*a)%mod;
			b>>=1;
		}
		return res;
	}
	ll qpow(ll a,ll b){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res*=a;
			a*=a;
			b>>=1;
		}
		return res;
	}
	#define db double
	#define pf printf
	#define pc putchar
	#define fr(i,x,y) for(register ll i=(x);i<=(y);i++)
	#define pfr(i,x,y) for(register ll i=(x);i>=(y);i--)
	#define go(u) for(ll i=head[u];i;i=e[i].nxt)
	#define enter pc('\n')
	#define space pc(' ')
	#define fir first
	#define sec second
	#define MP make_pair
	#define il inline
	#define inf 1e18
	#define random(x) rand()*rand()%(x)
	#define inv(a,mod) my_pow((a),(mod-2),(mod))
	il ll read(){
		ll sum=0,f=1;
		char ch=0;
		while(!isdigit(ch)){
			if(ch=='-') f=-1;
			ch=getchar();
		}
		while(isdigit(ch)){
			sum=sum*10+(ch^48);
			ch=getchar();
		}
		return sum*f;
	}
	il void write(ll x){
		if(x<0){
			x=-x;
			pc('-');
		}
		if(x>9) write(x/10);
		pc(x%10+'0');
	}
	il void writeln(ll x){
		write(x);
		enter;
	}
	il void writesp(ll x){
		write(x);
		space;
	}
}
using namespace my_std;
#define mod 1000000007
ll t,n,a,b,c,k1,k2,C[11][11];
struct node{
	ll cnt1,cnt2,ans[11][11];
}I;
il node operator*(const node &x,const node &y){
	node res=I;
	res.cnt1=(x.cnt1+y.cnt1)%mod;
	res.cnt2=(x.cnt2+y.cnt2)%mod;
	fr(i,0,k1){
		fr(j,0,k2){
			res.ans[i][j]=x.ans[i][j];
			ll pw1=1;
			fr(ii,0,i){
				ll pw2=1;
				fr(jj,0,j){
					res.ans[i][j]=(res.ans[i][j]+C[i][ii]*C[j][jj]%mod*pw1%mod*pw2%mod*y.ans[i-ii][j-jj]%mod)%mod;
					pw2=pw2*x.cnt2%mod;
				}
				pw1=pw1*x.cnt1%mod;
			}
		}
	}
	return res;
}
node mpow(node x,ll y){
	node res=I;
	while(y){
		if(y&1) res=res*x;
		x=x*x;
		y>>=1;
	}
	return res;
}
node solve(ll P,ll Q,ll R,ll N,node A,node B){
	if(!N) return I;
	if(P>=Q) return solve(P%Q,Q,R,N,A,mpow(A,P/Q)*B);
	ll m=(P*N+R)/Q;
	if(!m) return mpow(B,N);
	else return mpow(B,(Q-R-1)/P)*A*solve(Q,P,(Q-R-1)%P,m-1,B,A)*mpow(B,N-(Q*m-R-1)/P);
}
int main(){
	t=read();
	node U=I,R=I;
	R.cnt1=1;
	fr(i,0,10) R.ans[i][0]=1;
	U.cnt2=1;
	fr(i,0,10){
		C[i][0]=1;
		fr(j,1,i) C[i][j]=(C[i-1][j-1]+C[i-1][j])%mod;
	}
	while(t--){
		n=read();
		a=read();
		b=read();
		c=read();
		k1=read();
		k2=read();
		node res=mpow(U,b/c)*solve(a,c,b%c,n,U,R);
		writeln((my_pow(0,k1,mod)*my_pow(b/c,k2,mod)%mod+res.ans[k1][k2])%mod);
	}
}