#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pii pair<int,int>
#define vi vector<int>
#define si set<int>
#define qi queue<int>
#define sti stack<int>
#define fi first
#define se second
#define pb push_back
const int N=6;
ll p,q,n=4,m,mod;
struct sdf{
	ll p[N][N];
	sdf(){
		for (int i=1;i<=n;i++){
			for (int j=1;j<=n;j++)p[i][j]=0;
		}
	}
	sdf operator*(const sdf&x)const{
		sdf tmp;
		for (int i=1;i<=n;i++){
			for (int j=1;j<=n;j++){
				for (int k=1;k<=n;k++){
					tmp.p[i][j]=(tmp.p[i][j]+p[i][k]*x.p[k][j]%mod)%mod;
				}
			}
		}
		return tmp;
	}
}A,B,C,id,mp;
void fst(int x){
	if (!x){
		B=id;return ;
	}
	if (x&1){
		fst(x-1);B=B*A;return ;
	}
	else{
		fst(x/2);B=B*B;return ;
	}
}
ll calc(ll x){
	A=B=C;
	A.p[1][1]=1;
	A.p[1][4]=A.p[2][4]=2*x;
	A.p[1][3]=A.p[2][3]=A.p[3][3]=A.p[3][4]=A.p[4][4]=x;
	fst(m);
	return B.p[1][4];
}
int main(){
	freopen ("alienlanguage.in","r",stdin);
	freopen ("alienlanguage.out","w",stdout);
	scanf("%lld%lld%lld%lld",&p,&q,&m,&mod);
	for (int i=1;i<=n;i++)id.p[i][i]=1;
	ll x=calc(p),y=calc(q);
	printf("%lld\n",(x*y%mod+x+y)%mod);
	return 0;
}