#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rrep(i, n) for(int i = n-1; i >= 0; --i)
#define fi first
#define se second
using namespace std;
using lint = long long;
using uint = unsigned int;
using ulint = unsigned long long;
using ldouble = long double;
using pii = pair<int, int>;
using pli = pair<lint, lint>;
using pdd = pair<double, double>;
using pld = pair<ldouble, ldouble>;
using v1i = vector<int>;
using v1li = vector<lint>;
using v2i = vector<vector<int>>;
using v2li = vector<vector<lint>>;
using v3i = vector<vector<vector<int>>>;
using v3li = vector<vector<vector<lint>>>;
using v1b = vector<bool>;
using v2b = vector<vector<bool>>;
using v3b = vector<vector<vector<bool>>>;
using v1c = vector<char>;
using v2c = vector<vector<char>>;
using v3c = vector<vector<vector<char>>>;
constexpr lint mod1 = 1e9+7;

int main() {
    lint pb = 0, pw = 0, qb = 0, qw = 0, xp = 0, xq = 0;
    uint a, b, x, n, x0;
    cin >> a >> b >> x >> n;
    x0 = x;
    vector<uint> v;
    rep(i, 2*n){
        x *= a;
        x += b;
        v.push_back(x);
        if(x == x0) break;
    }
    rep(i, 2*n){
        if(i % 2 == 0){
            xp += (v[i%v.size()] % 6 + 1);
            if(xp % 2 == 0) pw++;
            else pb++;
        }
        else{
            xq += (v[i%v.size()] % 6 + 1);
            if(xq % 2 == 0) qw++;
            else qb++;
        }
    }
    cout << min(pb, pw) << " " << min(qb, qw) << endl;
    return 0;
}