#include <map>
#include <set>
#include <stack>
#include <cmath>
#include <queue>
#include <cstdio>
#include <vector>
#include <string>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <algorithm>
#define ls (r<<1)
#define rs (r<<1|1)
#define debug(a) cout << #a << " " << a << endl
using namespace std;
typedef long long ll;
const ll maxn = 2;   //数组的大小尽量开的小，开大了会tle！！！
const ll mod = 1e9 + 7;
struct matrix {
    ll a[maxn][maxn];
};
matrix ans, base;
ll m;
matrix mul( matrix x, matrix y ) {
    matrix tmp;
    for( ll i = 0; i < 2; i ++ ) {
        for( ll j = 0; j < 2; j ++ ) {
            tmp.a[i][j] = 0;
            for( ll k = 0; k < 2; k ++ ) {
                tmp.a[i][j] = ( tmp.a[i][j] + x.a[i][k]*y.a[k][j] + m ) % m;
            }
        }
    }
    return tmp;
}
ll qow( ll n ) {
    while( n ) {
        if( n&1 ) {
            ans = mul( ans, base );
        }
        base = mul( base, base );
        n /= 2;
    }
    return ans.a[0][0];
}
int main() {
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    ll a, b, n;
    while( cin >> a >> b >> n >> m ) {
        double tmp = a + sqrt(b);
        ll t1 = (ll)(tmp+1), t2 = (ll)(tmp*tmp+1);
        base.a[0][0] = 2*a, base.a[0][1] = 1;
        base.a[1][0] = (b-a*a+m)%m, base.a[1][1] = 0;
        ans.a[0][0] = t2, ans.a[0][1] = t1;
        ans.a[1][0] = 0, ans.a[1][1] = 0;
        if( n == 1 ) {
            cout << t1 << endl;
        } else if( n == 2 ) {
            cout << t2 << endl;
        } else {
            cout << qow(n-2) << endl;
        }
    }
    return 0 ;
}