#pragma GCC optimize("O3")
#pragma GCC target("avx")
#include <bits/stdc++.h>
#define rep(i ,n) for(int i=0;i<(int)(n);++i)
#define repr(i ,n) for(int i=n;i>(int)(n);--i)
#define rep1(i ,n) for(int i=1;i<=(int)(n);++i)
#define ALL(a) a.begin(), a.end()
#define SORT(a) sort(ALL(a))
#define bit_check(bit, i) ((bit>>(i)) & 1)
#define PRINT(x) printf("%d\n",(x));
using namespace std;
typedef long long int int64;
typedef unsigned long long uint64;
template<class T> using V = vector<T>;
using I = int;
using VI = V<I>;
const int INF = 2e9;
const int64 MOD = 1e9 + 7;

template <class T> inline bool chmin(T& a, T b){if(a>b){a=b; return true;} return false;}
template <class T> inline bool chmax(T& a, T b){if(a<b){a=b; return true;} return false;}

int main(){
    uint64 a , b , x0 ,n;
    cin >> a >> b >> x0 >> n;
    if( n == 0) { cout << 0 << " " << 0 << endl; return 0; }
    vector<uint64> x(n);
    x[0] = x0;
    for(int i = 1; i < n ; ++i){
        x[i]=(a*x[i-1]+b)%(int)pow(2,32); 
    }
    uint64 ta[2]={0};
    uint64 ao[2]={0};
    int i , j;
    for(i=2 ; i <= n ; i+=2){
        if((x[i]%6+1)%2 != 0) ++ta[0];
        else ++ta[1]; 
    }
    for(i=2 ; i <=n ; i+=2){
        if((x[i]%6+1)%2 != 0) ++ao[j]; //white
        else ++ao[1]; //black
    }
    chmin(ta[0] , ta[1]);
    chmin(ao[0] , ao[1]);

    cout << ta[0] << " " << ao[0] << endl;

}