import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
write=sys.stdout.write

a,b,x,N=map(int,readline().split())
mod=1<32
B0,W0,B1,W1=0,0,0,0
cur0,cur1=0,0
for _ in range(N):
    x=(a*x+b)%mod
    cur0+=x%6+1
    if cur0%2:
        B0+=1
    else:
        W0+=1
    x=(a*x+b)%mod
    cur1+=x%6+1
    if cur1%2:
        B1+=1
    else:
        W1+=1
print(min(B0,W0),min(B1,W1))