Pagini recente » Cod sursa (job #1413195) | Cod sursa (job #2589884) | Cod sursa (job #1051360) | Cod sursa (job #877146) | Cod sursa (job #2457596)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("matrice5.in");
ofstream fout("matrice5.out");
const int MOD = 10007;
long long lgput(int n,int p)
{
long long rasp=1;
while(p!=0)
{
if(p%2==1){
rasp=(1LL*rasp*n)%MOD;
p--;
}
else{
n=(1LL*n*n)%MOD;
p/=2;
}
}
return rasp;
}
int main()
{
int q,n,m,p,k;
fin >> q;
for(int i=1;i<=q;i++)
{
fin >> n >> m >> p >> k;
fout << (1LL*lgput(p*k,(n-1)*(m-1))*lgput(p,n+m-1))%MOD << '\n';
}
return 0;
}