#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

int main(){
  unsigned int a,b,x,N; cin >> a >> b >> x >> N;
  int tx=0,ax=0;
  vector<int> tv,av;
  rep(i,6){
    x = a*x+b;
    tx+=(x%6+1);
    tv.pb(tx%2);
    x = a*x+b;
    ax+=(x%6+1);
    av.pb(ax%2);
  }
  ll tb=count(all(tv),0);
  ll tw=count(all(tv),1);
  ll ab=count(all(av),0);
  ll aw=count(all(av),1);
  tb*=N/6;
  tw*=N/6;
  ab*=N/6;
  aw*=N/6;
  rep(i,(int)(N%6)){
    if(tv[i]==0) tb++;
    else tw++;
    if(av[i]==0) ab++;
    else aw++;
  }
  cout << min(tb,tw) << ' ' << min(ab,aw) << endl;
  return 0;
}