#include<iostream>

#include<cstdio>

#include<cstring>

#include<cstdlib>

#include<cmath>

using namespace std;

const int MAXN = ;

const int mod = ;

typedef long long LL;

inline int rd(){

    int x=,f=;char ch=getchar();

    while(!isdigit(ch)) {f=ch=='-'?:;ch=getchar();}

    while(isdigit(ch))  {x=(x<<)+(x<<)+ch-'';ch=getchar();}

    return f?x:-x;

}

int a,b,k,n,m;

LL C[MAXN][MAXN];

int fast_pow(int x,int y){

    int ret=;

    for(;y;y>>=){

        if(y&) ret=(LL)ret*x%mod;

        x=(LL)x*x%mod;

    }

    return ret;

}

int main(){

    a=rd(),b=rd(),k=rd(),n=rd(),m=rd();

    for(int i=;i<=k+;i++){

        C[i][]=;

        for(int j=;j<=i;j++) C[i][j]=C[i-][j]+C[i-][j-],C[i][j]%=mod;

    }

    printf("%lld",(LL)fast_pow(a,n)*fast_pow(b,m)%mod*C[k+][n]%mod);

    return ;

}