#include <bits/stdc++.h>

const int N = 13, M = 60, Mod = 1e9 + 7;

inline int read()
{
    int x = 0, f = 0;
    char ch = getchar();

    while (!isdigit(ch))
        f |= ch == '-', ch = getchar();

    while (isdigit(ch))
        x = x * 10 + ch - '0', ch = getchar();

    return f ? -x : x;
}

inline int Pow(int a, int b)
{
    int res = 1;

    for (; b; b >>= 1, a = 1LL * a * a % Mod)
        if (b & 1)
            res = 1LL * res * a % Mod;

    return res;
}

int a[N], b[N], A[N][N], comb[N][N], f[N][N][61];

inline void poly(int *f, int n)
{
    for (int i = 0; i <= n; ++i)
    {
        int w = a[i];

        for (int j = 0; j <= n; ++j)
            b[j] = 0;

        b[0] = 1;

        for (int j = 0; j <= i - 1; ++j)
            w = 1LL * w * Pow(i - j, Mod - 2) % Mod;

        for (int j = i + 1; j <= n; ++j)
            w = Mod - 1LL * w * Pow(j - i, Mod - 2) % Mod;

        for (int j = 0; j <= n; ++j)
            if (i != j)
            {
                for (int k = n; k >= 1; --k)
                    b[k] = (b[k - 1] - 1LL * b[k] * j % Mod + Mod) % Mod;

                b[0] = Mod - 1LL * b[0] * j % Mod;
            }

        for (int j = 0; j <= n; ++j)
            (f[j] += 1LL * w * b[j] % Mod) %= Mod;
    }
}

inline int calc(int n, int a)
{
    int w = 1, res = 0;

    for (int i = 0; i <= n + 1; ++i)
        (res += 1LL * A[n][i] * w % Mod) %= Mod, w = 1LL * w * a % Mod;

    return res;
}

inline void init()
{
    for (int i = 0; i <= 10; ++i)
    {
        a[0] = i == 0;

        for (int j = 1; j <= i + 1; ++j)
            a[j] = (a[j - 1] + Pow(j, i)) % Mod;

        poly(A[i], i + 1);
    }

    // for (int i = 0; i <= 10; ++i, putchar('\n'))
    // for (int j = 0; j <= i + 1; ++j) printf("%d ", A[i][j]);
    for (int i = 0; i <= 10; ++i)
    {
        comb[i][0] = 1;

        for (int j = 1; j <= i; ++j)
            comb[i][j] = (comb[i - 1][j] + comb[i - 1][j - 1]) % Mod;
    }
}

inline int solve(int a, int b, int c, int k1, int k2, int n, int d)
{
    if (!a)
        return 1LL * calc(k1, n) * Pow(b / c, k2) % Mod;

    if (f[k1][k2][d] != -1)
        return f[k1][k2][d];

    if (a >= c)
    {
        int res = 0;

        for (int i = 0; i <= k2; ++i)
        {
            int w = 1LL * comb[k2][i] * Pow(a / c, i) % Mod;
            (res += 1LL * w * solve(a % c, b, c, k1 + i, k2 - i, n, d + 1) % Mod) %= Mod;
        }

        return res;
    }

    if (b >= c)
    {
        int res = 0;

        for (int i = 0; i <= k2; ++i)
        {
            int w = 1LL * comb[k2][i] * Pow(b / c, i) % Mod;
            (res += 1LL * w * solve(a, b % c, c, k1, k2 - i, n, d + 1) % Mod) %= Mod;
        }

        return res;
    }

    int m = (1LL * a * n + b) / c, ans = 1LL * Pow(m, k2) * calc(k1, n) % Mod, res = 0;

    for (int j = 0; j < k2; ++j)
        for (int i = 0; i <= k1 + 1; ++i)
            (res += 1LL * comb[k2][j] * A[k1][i] % Mod * solve(c, c - b - 1, a, j, i, m - 1, d + 1) % Mod) %= Mod;

    return f[k1][k2][d] = (ans - res + Mod) % Mod;
}

int main()
{
    int T = read();
    init();

    for (int i = 0; i < T; ++i)
    {
        int n = read(), a = read(), b = read(), c = read(), k1 = read(), k2 = read();
        memset(f, -1, sizeof(f)), printf("%d\n", solve(a, b, c, k1, k2, n, 0));
    }

    return 0;
}