#define  _CRT_SECURE_NO_WARNINGS
#pragma comment (linker, "/STACK:526000000")

#include "bits/stdc++.h"

using namespace std;
typedef string::const_iterator State;
#define eps 1e-11L
#define MAX_MOD 1000000007LL
#define GYAKU 500000004LL

#define MOD 998244353LL
#define seg_size 262144 * 4LL
#define pb push_back
#define mp make_pair
typedef long long ll;
#define REP(a,b) for(long long (a) = 0;(a) < (b);++(a))
#define ALL(x) (x).begin(),(x).end()

void init() {
    iostream::sync_with_stdio(false);
    cout << fixed << setprecision(20);
}

#define int unsigned long long
int a, b, x, n;
void calc() {
    x = a * x + b;
    x %= 6;
    return;
}

void solve() {
    cin >> a >> b >> x >> n;
    x %= 6;
    a %= 6;
    b %= 6;
    pair<int, int> c = mp(0, 0);
    pair<int, int> d = mp(0, 0);
    int steps[2] = {};
    calc();
    for (int i = 0; i < n; ++i) {
        if (i % (2 * 3 * 4 * 5 * 6 * 2) == -1 && i == 2 * 3 * 4 * 5 * 6 * 2) {
            int diff = (n - i) / 720;
            i += diff * 720;
            c.first *= diff + 1;
            c.second *= diff + 1;
            d.first *= diff + 1;
            d.second *= diff + 1;
            if (i == n) break;
        }
        steps[0] += (x + 1) % 2;
        if (steps[0] % 2 == 0) {
            c.first++;
        }
        else {
            c.second++;
        }
        calc();
        steps[1] += (x + 1) % 2;
        if (steps[1] % 2 == 0) {
            d.first++;
        }
        else {
            d.second++;
        }
        calc();
    }
    cout << min(c.first, c.second) << " " << min(d.first, d.second) << endl;
}

#undef int
int main() {
    init();

    solve();
}