#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

template<int MOD>
struct ModInt {
    static const int Mod = MOD;
    unsigned x;
    ModInt() : x(0) {}
    ModInt(signed sig) { int sigt = sig % MOD; if(sigt < 0) sigt += MOD; x = sigt; }
    ModInt(signed long long sig) { int sigt = sig % MOD; if(sigt < 0) sigt += MOD; x = sigt; }
    int get() const { return (int)x; }

    ModInt &operator+=(ModInt that) { if((x += that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(ModInt that) { if((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
    ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }

    ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
    ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
    ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
    ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }

    ModInt inverse() const {
        signed a = x, b = MOD, u = 1, v = 0;
        while(b) {
            signed t = a / b;
            a -= t * b; std::swap(a, b);
            u -= t * v; std::swap(u, v);
        }
        if(u < 0) u += Mod;
        ModInt res; res.x = (unsigned)u;
        return res;
    }

    bool operator==(ModInt that) const { return x == that.x; }
    bool operator!=(ModInt that) const { return x != that.x; }
    ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
    ModInt<MOD> r = 1;
    while(k) {
        if(k & 1) r *= a;
        a *= a;
        k >>= 1;
    }
    return r;
}
typedef ModInt<1000000007> mint;


#pragma region for precomputing
int berlekampMassey(const vector<mint> &s, vector<mint> &C) {
    int N = (int)s.size();
    C.assign(N + 1, mint());
    vector<mint> B(N + 1, mint());
    C[0] = B[0] = 1;
    int degB = 0;
    vector<mint> T;
    int L = 0, m = 1;
    mint b = 1;
    for(int n = 0; n < N; ++ n) {
        mint d = s[n];
        for(int i = 1; i <= L; ++ i)
            d += C[i] * s[n - i];
        if(d == mint()) {
            ++ m;
        } else {
            if(2 * L <= n)
                T.assign(C.begin(), C.begin() + (L + 1));
            mint coeff = -d * b.inverse();
            for(int i = 0; i <= degB; ++ i)
                C[m + i] += coeff * B[i];
            if(2 * L <= n) {
                L = n + 1 - L;
                B.swap(T);
                degB = (int)B.size() - 1;
                b = d;
                m = 1;
            } else {
                ++ m;
            }
        }
    }
    C.resize(L + 1);
    return L;
}

void computeMinimumPolynomialForLinearlyRecurrentSequence(const vector<mint> &a, vector<mint> &phi) {
    int n2 = (int)a.size(), n = n2 / 2;
    assert(n2 % 2 == 0);
    int L = berlekampMassey(a, phi);
    reverse(phi.begin(), phi.begin() + (L + 1));
}

#pragma endregion

mint linearlyRecurrentSequenceValue(long long K, const vector<mint> &initValues, const vector<mint> &annPoly) {
    assert(K >= 0);
    if(K < (int)initValues.size())
        return initValues[(int)K];
    int d = (int)annPoly.size() - 1;
    assert(d >= 0);
    assert(annPoly[d].get() == 1);
    assert(d <= (int)initValues.size());
    if(d == 0)
        return mint();
    vector<mint> coeffs(d), square;
    coeffs[0] = 1;
    int l = 0;
    while((K >> l) > 1) ++ l;
    for(; l >= 0; -- l) {
        square.assign(d * 2 - 1, mint());
        for(int i = 0; i < d; ++ i)
            for(int j = 0; j < d; ++ j)
                square[i + j] += coeffs[i] * coeffs[j];
        for(int i = d * 2 - 2; i >= d; -- i) {
            mint c = square[i];
            if(c.x == 0) continue;
            for(int j = 0; j < d; ++ j)
                square[i - d + j] -= c * annPoly[j];
        }
        for(int i = 0; i < d; ++ i)
            coeffs[i] = square[i];
        if(K >> l & 1) {
            mint lc = coeffs[d - 1];
            for(int i = d - 1; i >= 1; -- i)
                coeffs[i] = coeffs[i - 1] - lc * annPoly[i];
            coeffs[0] = mint() - lc * annPoly[0];
        }
    }
    mint res;
    for(int i = 0; i < d; ++ i)
        res += coeffs[i] * initValues[i];
    return res;
}

mint linearlyRecurrentSequenceValue(long long K, const pair<vector<mint>, vector<mint> > &seqPair) {
    return linearlyRecurrentSequenceValue(K, seqPair.first, seqPair.second);
}

vector<mint> fact, factinv;
void nCr_computeFactinv(int N) {
    N = min(N, mint::Mod - 1);
    fact.resize(N + 1); factinv.resize(N + 1);
    fact[0] = 1;
    rer(i, 1, N) fact[i] = fact[i - 1] * i;
    factinv[N] = fact[N].inverse();
    for(int i = N; i >= 1; i --) factinv[i - 1] = factinv[i] * i;
}
mint nCr(int n, int r) {
    if(n >= mint::Mod)
        return nCr(n % mint::Mod, r % mint::Mod) * nCr(n / mint::Mod, r / mint::Mod);
    return r > n ? 0 : fact[n] * factinv[n - r] * factinv[r];
}


inline unsigned long long modmult(unsigned long long x, unsigned long long y, unsigned long long MOD) {
    x %= MOD, y %= MOD;
    unsigned long long a = x, r = 0;
    while(y) {
        if(y & 1)
            if((r += a) >= MOD) r -= MOD;
        if((a += a) >= MOD) a -= MOD;
        y >>= 1;
    }
    return r;
}

long long powmodll(long long a, unsigned long long k, const long long MOD) {
    a %= MOD;
    long long r = MOD == 1 ? 0 : 1;
    while(k) {
        if(k & 1)
            r = modmult(r, a, MOD);
        a = modmult(a, a, MOD);
        k >>= 1;
    }
    return r;
}

int main() {
    nCr_computeFactinv(100);
    //\sum_{k=0}^n C(n,n-k) a^(n-k) (sqrt(b)^k + (-sqrt(b))^k)
    //2 \sum_{k=0}^{n/2} C(n,n-2k) a^(n-2k) b^k
    //2 \sum_{k=0}^{n/2} C(n,n-2k) a^(n-2k) b^k
    int T;
    scanf("%d", &T);
    for(int ii = 0; ii < T; ++ ii) {
        int a; int b; int x; long long y;
        cin >> a >> b >> x >> y;
        vector<mint> seq(12);
        rer(n, 0, 11) {
            rer(k, 0, n / 2)
                seq[n] += nCr(n, n - 2 * k) * (mint(a) ^ (n - 2 * k)) * (mint(b) ^ k);
            seq[n] *= 2;
        }
        vector<mint> phi;
        computeMinimumPolynomialForLinearlyRecurrentSequence(seq, phi);
        //= X^(x^y mod ord(f)) mod f
        //ord(f) | ord
        ll ord = (ll)mint::Mod * mint::Mod - 1;
        long long K = powmodll(x, y, ord);
        if(x > 1) {
            ll t = 1;
            for(int i = 0; i < y; ++ i) {
                if(t > ord / x) {
                    K += ord;
                    break;
                }
                t *= x;
            }
        }
        mint ans = linearlyRecurrentSequenceValue(K, seq, phi);
        printf("%d\n", ans.get());
    }
    return 0;
}