C++ :

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 10007
#define N 2100
long long a,b,k,n,m;
long long g[N][N];

inline void INIT(){
    g[1][1]=1;
    for (long long i=2;i<=k+1;i++){
        for (long long j=1;j<=i;j++){
            g[i][j]=(g[i-1][j-1]%MOD+g[i-1][j]%MOD)%MOD;
        }
    }
}

long long poww(long long a,long long i){
    if(i==0) return 1;
    long long temp=poww(a,i>>1)%MOD;
    temp=(temp*temp)%MOD;
    if(i&1) temp=(long long)(temp*a)%MOD;
    return temp%MOD;
}

int main(){
    
    scanf("%lld%lld%lld%lld%lld",&a,&b,&k,&n,&m);
    INIT();
    printf("%lld",((((g[k+1][k-n+1]%MOD)*poww(a,n))%MOD)*poww(b,m))%MOD);
    return 0;
}