#include <bits/stdc++.h>

using namespace std;

using ll = long long;

constexpr ll MOD = 1LL << 32;

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    ll a, b, x0, n;
    cin >> a >> b >> x0 >> n;
    
    constexpr int m = 100000;
    array<int, m> memo{};
    ll x = x0;
    for (int i = 0; i < m; ++i) {
        x = (a * x % MOD + b) % MOD;
        memo[i] = (x & 1);
    }

    ll ct[2] = {};
    ll ca[2] = {};
    for (int i = 0; i < m; ++i) {
        if (i == 2 * n) break;
        ll cnt = 2 * n / m + (i < 2 * n % m);
        if (i % 2 == 0) ct[memo[i]] += cnt;
        else ca[memo[i]] += cnt;
    }
    //cerr << ct[0] << "," << ct[1] << " " << ca[0] << "," << ca[1] << "\n";

    cout << min(ct[0], ct[1]) << " " << min(ca[0], ca[1]) << "\n";
    return 0;
}