#include<bits/stdc++.h>
using namespace std;
const int M=10007;
int a,b,k,n,m;
int pow(int x,int y){
    int ans=1,p=x;
    while(y){
        if(y&1)ans*=p%M,ans%=M;
        p=p*p%M;
        y>>=1;
    }
    return ans%M;
}
int C(int n,int m){
    if(m==0)return 1;
    if(m==1)return n;
    return (C(n-1,m)+C(n-1,m-1))%M;
}
int main(){
    cin >> a >> b >> k >> n >> m;
    a%=M,b%=M;
    int ans=1;
    ans*=(pow(a,n)*pow(b,m))%M;
    if(n>m)n=m;
    ans*=C(k,n)%M;
    ans%=M;
    cout << ans;
    return 0;
}