#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i,n) for(int i=0;i<n;i++)

const ll mod = ll(1e9) + 7;
const int INF = 1<<29;

int main(){
    ll a,b,x0,n;
    cin >> a >> b >> x0 >> n;
    ll m = pow(2,32);
    vector<bool> tkhs,aok;
    ll x;
    rep(i,n){
        x = (a * x + b) % m;
        tkhs.push_back(x%2);
        x = (a * x + b) % m;
        aok.push_back(x%2);
    }
    ll bk = 0,wh = 0;
    for (auto y:tkhs){
        if (y) bk++;
        else wh++;
    }
    ll tk = min(bk,wh);
    bk = 0,wh = 0;
    for (auto y:aok){
        if (y) bk++;
        else wh++;
    }
    ll ao = min(bk,wh);
    printf("%ld %ld\n",tk,ao);
    return 0;
}