#include <bits/stdc++.h>
using namespace std;
int a, b, k, n, m;
long long f[1005][1005];
int ksm(int x, int y) {//快速幂
	if(y==1) return x;
	if (y % 2 == 0){
		int xy=ksm(x,y/2)%10007;
		return (xy*xy)%10007;
	}else{
		int xy=ksm(x,y/2)%10007;
		return (xy*xy*x)%10007;
	}
}
void df() {//杨辉三角
	for (int i = 1; i <= 1000; i++)f[i][1] = f[i][i] = 1;
	for (int i = 3; i <= 1000; i++) {
		for (int j = 2; j < i; j++) {
			f[i][j] = (f[i - 1][j] % 10007 + f[i - 1][j - 1] % 10007) % 10007;
		}
	}
}
int main () {
	cin >> a >> b >> k >> n >> m;
	df();
	cout << f[k + 1][m + 1]*ksm(a,n)*ksm(b,m)%10007;//求和
	return 0;
}