#include<bits/stdc++.h>
#define int long long
using namespace std;
int dp[10005][10005],w[10005];
const int mod=100003
int a,b,c,d,k,ans;
signed main(){
    cin>>a>>b>>c>>d>>k;
    for(int i=1;i<=c;i++){
        w[i]=d;
        dp[i][0]=1;
    }
    for(int i=1;i<=a;i++){
        w[c+i]=d+b,dp[c+i][0]=1;
    }
    dp[0][0]=1;
    for(int j=1;j<=a+c;j++){
        for(int i=1;i<=k;i++){
			dp[j][i]=(dp[j-1][i]+dp[j-1][i-1]*(w[j]-i+1))%mod;
		}
    }
    cout<<dp[a+c][k]
    return 0;
}