ll a0,a1,p,q,k;
struct matrix
{
ll a[2][2];
matrix()
{
memset(a,0,sizeof a);
}
};
matrix operator *(const matrix &x,const matrix &y)//矩阵相乘函数
{
matrix res;
for(int i=0;i<2;i++)
for(int j=0;j<2;j++)
{
for(int k=0;k<2;k++)
res.a[i][j]+=x.a[i][k]*y.a[k][j];
res.a[i][j]%=10000;
}
return res;
}
ll calc(matrix ans,ll n)
{
matrix res;
for(int i=0;i<2;i++) res.a[i][i]=1;
while(n)
{
if(n&1) res=res*ans;
ans=ans*ans;
n>>=1;
}
return (res.a[0][0]*a1+res.a[0][1]*a0)%mod;//f[0]=a0,f[1]=a1;
}
int main()
{
long long ans;
//f[n]=p*f[n-1]+q*f[n-2];
while(cin>>a0>>a1>>p>>q>>k)
{
matrix base;
base.a[0][0]=p;
base.a[0][1]=q;
base.a[1][0]=1;
base.a[1][1]=0;
cout<<calc(base,k-1)<<endl;
}
return 0;
}