#include using namespace std; typedef long long ll; typedef vector VI; typedef vector VVI; typedef vector VL; typedef vector> VVL; typedef pair Pair; typedef tuple tpl; #define ALL(a) (a).begin(),(a).end() #define SORT(c) sort((c).begin(),(c).end()) #define REVERSE(c) reverse((c).begin(),(c).end()) #define EXIST(m,v) (m).find((v)) != (m).end() #define LB(a,x) lower_bound((a).begin(), (a).end(), x) - (a).begin() #define UB(a,x) upper_bound((a).begin(), (a).end(), x) - (a).begin() #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) #define RFOR(i,a,b) for(int i=(a)-1;i>=(b);--i) #define RREP(i,n) RFOR(i,n,0) #define en "\n" constexpr double EPS = 1e-9; constexpr double PI = 3.1415926535897932; constexpr int INF = 2147483647; constexpr long long LINF = 1LL<<60; constexpr long long MOD = 1000000007; // 998244353; template inline bool chmax(T& a, T b){if(a inline bool chmin(T& a, T b){if(a>b){a=b;return true;}return false;} template struct modint { long long x; modint(long long x=0):x((x%mod+mod)%mod){} long long val(){ return x; } modint operator-() const { return modint(-x);} modint& operator+=(const modint a) { if ((x += a.x) >= mod) x -= mod; return *this; } modint& operator-=(const modint a) { if ((x += mod-a.x) >= mod) x -= mod; return *this; } modint& operator*=(const modint a) { (x *= a.x) %= mod; return *this; } modint operator+(const modint a) const { modint res(*this); return res+=a; } modint operator-(const modint a) const { modint res(*this); return res-=a; } modint operator*(const modint a) const { modint res(*this); return res*=a; } modint pow(long long t) const { if (!t) return 1; modint a = pow(t>>1); a *= a; if (t&1) a *= *this; return a; } // must be gcd(x,mod)==1 modint inv() const { // a^{-1} = 1/a mod p (拡張Euclidの互除法) long long b = mod, u = 1, v = 0, z = x; while(b){ long long t = z / b; z -= t * b; swap(z, b); u -= t * v; swap(u, v); } u %= mod; if (u < 0) u += mod; return modint(u); } //modint inv() const { // return pow(mod-2); //} modint& operator/=(const modint a) { return (*this) *= a.inv(); } modint operator/(const modint a) const { modint res(*this); return res/=a; } }; using mint = modint<1000000007>; void Main(){ ll a,b,c,k; cin >> a >> b >> c >> k; mint x = mint(a)*b*c; ll p = modint<1000000006>(2).pow(k).x; ll ans = x.pow(p).x; cout << ans << en; return; } int main(void){ cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);cout<>t; while(t--) Main(); return 0; }