#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;
    map<int, tuple<int,pair<int, int>, pair<int, int>>> geko;
    pair<int, int> c = mp(0, 0);
    pair<int, int> d = mp(0, 0);
    for (int i = 0; i < n; ++i) {
        if (geko.count(x)) {
            int diff = i - get<0>(geko[x]);
            diff = (n - i - 3LL) / diff;
            if (diff > 0) {
                pair<int, int> e = get<1>(geko[x]);
                pair<int, int> f = get<2>(geko[x]);
                e.first = c.first - e.first;
                e.second = c.second - e.second;
                f.first = d.first - f.first;
                f.second = d.second - f.second;
                e.first *= diff;
                e.second *= diff;
                f.first *= diff;
                f.second *= diff;
                c.first += e.first;
                c.second += e.second;
                d.first += f.first;
                d.second += f.second;
                i += diff * (i - get<0>(geko[x]));
                if (i >= n) break;
            }
        }
        else {
            geko[x] = make_tuple(i, c, d);
        }
        if ((x % 6) % 2 == 0) {
            c.first++;
        }
        else {
            c.second++;
        }
        calc();
        if ((x % 6) % 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();
}