hdu4565

#include<iostream>
#include<cstdio>
#include<queue>
#include<algorithm>
#include<cmath>
#include<ctime>
#include<set>
#include<map>
#include<stack>
#include<cstring>
#define inf 2147483647
#define ls rt<<1
#define rs rt<<1|1
#define lson ls,nl,mid,l,r
#define rson rs,mid+1,nr,l,r
#define N 100010
#define For(i,a,b) for(long long i=a;i<=b;i++)
#define p(a) putchar(a)
#define g() getchar()

using namespace std;
long long aa,bb,n,mod,tt;
double t;
struct matrix{
    long long a[5];
    long long b[5][5];
    matrix operator *(const matrix&c)const{
        matrix r;
        For(i,1,2)
            For(j,1,2){
                r.b[i][j]=0;
                For(k,1,2)
                    r.b[i][j]=(r.b[i][j]+b[i][k]*c.b[k][j]%mod)%mod;
            }
        return r;
    }
}a;

void in(long long &x){
    long long y=1;
    char c=g();x=0;
    while(c<'0'||c>'9'){
        if(c=='-')y=-1;
        c=g();
    }
    while(c<='9'&&c>='0'){
        x=(x<<1)+(x<<3)+c-'0';c=g();
    }
    x*=y;
}
void o(long long x){
    if(x<0){
        p('-');
        x=-x;
    }
    if(x>9)o(x/10);
    p(x%10+'0');
}

matrix ksm(matrix a,long long b){
    matrix r=a;
    b--;
    if(b==0)    return r;
    while(b%2==0){
        a=a*a;
        b>>=1;
    }
    while(b>0){
        if(b%2==1)
            r=r*a;
        a=a*a;
        b>>=1;
    }
    return r;
}

int main(){
    while(cin>>aa>>bb>>n>>mod){
        if(n==0){
            o((long long)1%mod);p('
');
            continue;
        }
        a.a[1]=1;
        a.a[2]=0;
        a.b[1][1]=aa%mod;
        a.b[1][2]=bb%mod;
        a.b[2][1]=1;
        a.b[2][2]=aa%mod;
        matrix r,ans;
        r=ksm(a,n);
        For(i,1,2){
                ans.a[i]=0;
                For(k,1,2)
                    ans.a[i]=(ans.a[i]+a.a[k]*r.b[i][k]%mod)%mod;
            }
        tt=0;
        tt=(tt+ans.a[1])%mod;
        o((2*tt%mod+mod)%mod);p('
');
    }
    return 0;
}