#include <bits/stdc++.h>
#define int long long
using namespace std;

const int mod = 1e4 + 7;

int binexp(int b, int e){
    int ans = 1;
    while(e){
        if(e & 1){
            ans = ans * b % mod;
        }
        b = b * b % mod;
        e >>= 1;
    }
    return ans;
}

signed main(){
    
    int t;
    cin >> t;
    while(t--){
        int n, m, p, k;
        cin >> n >> m >> p >> k;
        cout << binexp(p * k % mod, (n - 1) * (m - 1)) * binexp(p, n + m - 1) % mod << '\n';
    }
    
    return 0;
}