Pagini recente » Cod sursa (job #2858225) | Cod sursa (job #146785) | Cod sursa (job #939495) | Cod sursa (job #879772) | Cod sursa (job #2089524)
#include <fstream>
using namespace std;
ifstream in("matrice5.in");
ofstream out("matrice5.out");
#define mod 10007
int pow(int a,int b) {
long long n,p,x=1;
n=a;p=b;
while (p) {
if (p%2==0) {
p=p/2;
n=(n*n)%mod;
}
else {
p--;
x=(x*n)%mod;
}
}
return x;
}
int main() {
int t,i,n,m,k,p;
in>>t;
for(i=1;i<=t;i++) {
in>>n>>m>>p>>k;
out<<((pow(p*k,(n-1)*(m-1))%mod)*(pow(p,n+m-1)%mod))%mod<<'\n';
}
return 0;
}