#include<bits/stdc++.h>
using namespace std;
long long a,b[10000008],c,d,n,i,ans,v;
const long long mod=4294967295;
long long pov(long long o, long long s){
    long long r=1;
    while(s>0){
        if(s&1) r=r*o&mod;
        o=o*o&mod;
        s>>=1;
    }
    return r;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);

/*freopen("power.in","r",stdin);
freopen("power.out","w",stdout);*/

cin>>a>>b[0]>>c>>d>>n;
for(i=1;i<=n;i++) b[i]=(b[i-1]*c+d)&mod;
sort(b+1,b+1+n);

v=pov(a,b[1]);
ans=v;
for(i=2;i<=n;i++){
    if(b[i]==b[i-1]) continue;
    v=v*pov(a,b[i]-b[i-1])&mod;
    ans=ans^v&mod;
}

cout<<ans;

return 0;
}