1 #include <iostream>
 2 #include <cstring>
 3 #include <cstdlib>
 4 #include <cstdio>
 5 using namespace std;
 6 const int maxn=210;
 7 int a,b,n,m;
 8 struct Array{
 9     int a[maxn],L;
10     void Init(int x){L=x;memset(a,0,sizeof(a));}
11     int *operator[](int x){return &a[(x-1)*L];}
12 };
13 struct Matrix{
14     int R,C;
15     Array mat;
16     void Init(int r,int c){mat.Init(c);R=r;C=c;}
17     int *operator[](int x){return mat[x];}
18     friend Matrix operator*(Matrix a,Matrix b){
19         Matrix c;c.Init(a.R,b.C);
20         for(int i=1;i<=a.R;i++)
21             for(int j=1;j<=b.C;j++)
22                 for(int k=1;k<=a.C;k++)
23                     (c[i][j]+=1ll*a[i][k]*b[k][j]%m)%=m;
24         return c;            
25     }
26     friend Matrix operator^(Matrix a,int k){
27         Matrix c;c.Init(a.R,a.C);
28         for(int i=1;i<=a.R;i++)c[i][i]=1;
29         while(k){if(k&1)c=c*a;k>>=1;a=a*a;}
30         return c;
31     }
32 }A,B;
33 
34 int main(){
35     while(scanf("%d%d%d%d",&a,&b,&n,&m)!=EOF){
36         A.Init(2,2);
37         A[1][1]=2*a%m;A[1][2]=(b-1ll*a*a%m+m)%m;
38         A[2][1]=1;A[2][2]=0;
39         
40         B.Init(2,1);
41         B[1][1]=2*a%m;
42         B[2][1]=2;
43         A=A^(n-1);B=A*B;
44         printf("%d\n",B[1][1]);
45     }
46     return 0;
47 }