#include <bits/stdc++.h>

using namespace std;

typedef long long LL;

const int N = 6e6 + 5, Block = 19, P = 998244353;

int A, B, C;
LL n;
int x00[N];
int *x0 = x00 + 2;
LL y[N], yy[N];

int main()
{
    scanf("%d%d%d%lld", &A, &B, &C, &n);
    if(n == 1) return printf("%d\n", A), 0;
    if(n == 2) return printf("%d\n", B), 0;
    n -= 3;
    LL T = 3 << Block;
    LL ans = 0;

    int m = 0;
    x0[-2] = A, x0[-1] = B;
    for(int i = -2; i < T - 2; i ++ )
    {
        x0[i + 2] = ((x0[i] ^ x0[i + 1]) + C) & ((1 << (Block + 1)) - 1);
        if((x0[i] ^ x0[i + 1]) + C >= (1 << (Block + 1))) y[ ++ m] = i + 2;
    }
    ans = x0[n % T];

    LL s = 1 << (Block + 1);
    for(int i = Block + 1; i <= 76; i ++ , s = s * 2 % P)
    {
        int mm = 0;
        x0[0] = x0[1] = x0[2] = 0;
        int x = -1;
        LL p = n % (T * 2);
        for(int i = 1; i <= m; i ++ )
        {
            if(y[i] > p && x == -1) x = x0[p % 3];
            if(x0[(y[i] + 1) % 3] ^= 1, !(x0[y[i] % 3] ^= 1))
                yy[ ++ mm] = y[i];
        }
        for(int i = 1; i <= m && y[i] + T <= n; i ++ )
        {
            if(y[i] + T > p && x == -1) x = x0[p % 3];
            if(x0[(y[i] + 1) % 3] ^= 1, !(x0[y[i] % 3] ^= 1))
                yy[ ++ mm] = y[i] + T;
        }
        if(x == -1) x = x0[p % 3];
        ans += s * x;
        T = min(T * 2, n + 1);
        m = mm;
        for(int i = 1; i <= m; i ++ ) y[i] = yy[i];
    }

    printf("%lld\n", ans % P);
    return 0;
}