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[];
     long long b[][];
     matrix operator *(const matrix&c)const{
         matrix r;
         For(i,,)
             For(j,,){
                 r.b[i][j]=;
                 For(k,,)
                     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=;
     char c=g();x=;
     while(c<''||c>''){
         if(c=='-')y=-;
         c=g();
     }
     while(c<=''&&c>=''){
         x=(x<<)+(x<<)+c-'';c=g();
     }
     x*=y;
 }
 void o(long long x){
     if(x<){
         p('-');
         x=-x;
     }
     if(x>)o(x/);
     p(x%+'');
 }
 
 matrix ksm(matrix a,long long b){
     matrix r=a;
     b--;
     if(b==)    return r;
     while(b%==){
         a=a*a;
         b>>=;
     }
     while(b>){
         if(b%==)
             r=r*a;
         a=a*a;
         b>>=;
     }
     return r;
 }
 
 int main(){
     while(cin>>aa>>bb>>n>>mod){
         if(n==){
             o((long long)%mod);p('\n');
             continue;
         }
         a.a[]=;
         a.a[]=;
         a.b[][]=aa%mod;
         a.b[][]=bb%mod;
         a.b[][]=;
         a.b[][]=aa%mod;
         matrix r,ans;
         r=ksm(a,n);
         For(i,,){
                 ans.a[i]=;
                 For(k,,)
                     ans.a[i]=(ans.a[i]+a.a[k]*r.b[i][k]%mod)%mod;
             }
         tt=;
         tt=(tt+ans.a[])%mod;
         o((*tt%mod+mod)%mod);p('\n');
     }
     return ;
 }