#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<queue>
#include<map>
#include<vector>
#include<set> 
#define inf 0x7fffffff
#define ll long long
#define ull unsigned long long
#define fi first
#define se second
using namespace std;
ll a,b,k,n,m;
const int mod=10007;
int c[1010][1010];
ll pow(ll x,ll y)
{
	ll res=1;
	while(y){
		if(y&1)
		res=res*x%mod;
		res=res*res%mod;
		y=y/2;
	}return res;
}
int main()
{
	freopen("factor.in","r",stdin);
	freopen("factor.out","w",stdout);
	cin>>a>>b>>k>>n>>m;
	c[0][0]=1;
	for(int i=1;i<=k;i++){
		c[i][0]=1;
		for(int j=1;j<=i;j++)
		c[i][j]=(c[i-1][j-1]+c[i-1][j])%mod;
	}
	cout<<pow(2,13)<<endl;
	ll ans=c[k][m];ans=(ans*pow(a,n))%mod;ans=(ans*pow(b,m))%mod;
	cout<<ans<<endl;
}