from collections import deque, defaultdict, Counter
from bisect import bisect_left, bisect_right
from itertools import permutations, combinations, groupby
from heapq import heappop, heappush
import math, sys
input = lambda: sys.stdin.readline().rstrip("\r\n")
def printl(li, sep=" "): print(sep.join(map(str, li)))
def yn(flag): print(Yes if flag else No)
_int = lambda x: int(x)-1
MOD = 998244353 #10**9+7
INF = 1<<60
Yes, No = "Yes", "No"

P, Q, Y0, p0, q0, Y = map(int, input().split())

if Y0 <= Y:
    while Y0 < Y:
        Y0 += 1
        p0 = p0%P+1
        q0 = q0%Q+1
else:
    while Y0 > Y:
        Y0 -= 1
        p0 = (p0-2)%P+1
        q0 = (q0-2)%Q+1
print(p0, q0)