#include <bits/stdc++.h>

using namespace std;

#define int long long
#define rep(i, s, e) for (int i = s; i <= e; ++i)
#define drep(i, s, e) for (int i = s; i >= e; --i)
#define file(a) freopen(#a".in", "r", stdin), freopen(#a".out", "w", stdout)
#define pv(a) cout << #a << " = " << a << endl
#define pa(a, l, r) cout << #a " : "; rep(_, l, r) cout << a[_] << ' '; cout << endl

const int P = 1e9 + 7;

const int N = 10 + 5;

int read() {
  int x = 0, f = 1; char c = getchar();
  for (; c < '0' || c > '9'; c = getchar()) if (c == '-') f = -1;
  for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - 48;
  return x * f;
}

int inc(int a, int b) { return (a += b) >= P ? a - P : a; }
int dec(int a, int b) { return (a -= b) < 0 ? a + P : a; }
int mul(int a, int b) { return 1ll * a * b % P; }
int qpow(int a, int b) { int res = 1; for (; b; b >>= 1, a = mul(a, a)) if (b & 1) res = mul(res, a); return res; }

int a, b, c, n, k1, k2, C[N][N];

void init(int w) {
  rep(i, 0, w) C[i][0] = 1;
  rep(i, 1, w) rep(j, 1, i) C[i][j] = inc(C[i - 1][j], C[i - 1][j - 1]);
}

struct node {
  int u, r, f[N][N];
  node(int _u = 0, int _r = 0) { u = _u, r = _r; rep(i, 0, k1) rep(j, 0, k2) f[i][j] = 0; }
  int* operator [] (int i) { return f[i]; }
  friend node operator * (node a, node b) {
    node res(inc(a.u, b.u), inc(a.r, b.r));
    rep(u, 0, k1) rep(v, 0, k2) {
      // if (u == 0 && v == 1) cout << "!!!\n";
      res[u][v] = a[u][v];
      rep(i, 0, u) rep(j, 0, v) {
        int t = mul(b[i][j], mul(C[u][i], C[v][j]));
        t = mul(t, mul(qpow(a.r, u - i), qpow(a.u, v - j)));
        res[u][v] = inc(res[u][v], t);
      }
    }
    return res;
  }
} fu(1, 0), fr(0, 1);

node qpow(node a, int b) {
  node res;
  for (; b; b >>= 1, a = a * a) if (b & 1) res = res * a;
  return res;
}

node calc(int a, int b, int c, int n, node fu, node fr) {
  b %= c;
  if (a >= c) return calc(a % c, b, c, n, fu, qpow(fu, a / c) * fr);
  else {
    int m = (a * n + b) / c;
    if (!m) return qpow(fr, n);
    else return qpow(fr, (c - b - 1) / a) * fu * calc(c, c - b - 1, a, m - 1, fr, fu) * qpow(fr, n - (c * m - b - 1) / a);
  }  
}

signed main() {
  fr[0][0] = 1, init(10);
  for (int tc = read(); tc; -- tc) {
    n = read(), a = read(), b = read(), c = read(), k1 = read(), k2 = read();
    node res = qpow(fu, b / c) * fr * calc(a, b, c, n, fu, fr);
    printf("%lld\n", res[k1][k2]);
  }
  return 0;
}