#include<iostream>
#include<map>
#include<vector>
#include <algorithm>
#include<math.h>
#include <iomanip>
#include<set>
#include <numeric>
using namespace std;


int main()
{
    long long a, b, x0, n, mod = pow(2, 32);
    cin >> a >> b >> x0 >> n;
    long long sumt = 0, suma = 0, bt = 0, ba = 0, wt = 0, wa = 0;
    for (int i = 0; i < n*2; i++){
        long long xi = ((a*x0 + b)%mod)%6 + 1;
        
        if (i%2){
            suma += xi;
            if (suma%2) ba++;
            else wa++;
        } else {
            sumt += xi;
            if (sumt%2) bt++;
            else wt++;
        }
        x0 = xi;
    }
    cout << min(bt, wt) << " " << min(ba, wa) << endl;
}