#include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod=1e5+3,N=10010;
int a,b,c,d,k,sum,fac[N];
int qpow(int m,int n){int ans=1;for(;n;n>>=1){if(n&1)ans=ans*m%mod;m=m*m%mod;}return ans;}
int inv(int x){return qpow(x,mod-2);}
int C(int m,int n){return m<n?0:fac[m]*inv(fac[n])%mod*inv(fac[m-n])%mod;}
signed main(){
   fac[0]=1;for(int i=1;i<=10000;i++) fac[i]=fac[i-1]*i%mod;
   cin>>a>>b>>c>>d>>k;
   for(int i=0;d-i>=0;i++){
      int cha=fac[d]*inv(fac[d-i])%mod*fac[(b+d)-i]%mod*inv(fac[b+d-k])%mod;
      sum=(sum+C(a,k-i)*C(c,i)%mod*cha%mod)%mod;
   }
   cout<<sum;
   return 0;
}