#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
constexpr int inf=1e9+7;
constexpr ll longinf=1LL<<60 ;
constexpr ll mod=1e9+7 ;


int cnt[2][2];
int main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	unsigned int a,b,x,n;
	cin>>a>>b>>x>>n;
	int s = 0,t = 0;
	/*rep(i,n){
		x = (a*x + b);
		s += x%6+1;
		cnt[0][s%2]++;

		x = (a*x + b);
		t += x%6+1;
		cnt[1][t%2]++;
	}*/
	if(x%2==0){
		cout<<0<<" "<<n/2<<endl;
	}
	else {
		cout<<n/2<<" "<<0<<endl;
	}
	return 0;
}