组合数高中知识搞搞就行
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ls (o<<1)
#define rs (o<<1|1)
#define pb push_back
const double PI= acos(-1.0);
const int M = 1e5+7;
/*
int head[M],cnt;
void init(){cnt=0,memset(head,-1,sizeof(head));}
struct EDGE{int to,nxt,val;}ee[M*2];
void add(int x,int y){ee[++cnt].nxt=head[x],ee[cnt].to=y,head[x]=cnt;}
*/
const int mod= 10007;
ll qpow(ll a,ll b)
{
ll ans=1;
while(b)
{
if(b&1)ans=ans*a%mod;
a=a*a%mod;
b/=2;
}
return ans;
}
ll factorial(ll n)
{
ll ans=1;
for(int i=1;i<=n;i++)
ans=ans*i%mod;
return ans;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll a,b,k,n,m;
cin>>a>>b>>k>>n>>m;
ll ans=qpow(a,n)*qpow(b,m)%mod;
ll p=factorial(k)*qpow(factorial(n)*factorial(k-n)%mod,mod-2)%mod;
ans=ans*p%mod;
cout<<ans<<endl;
return 0;
}