import sys
input = sys.stdin.readline

def prod(A,B,k,l,m):# A:k*l,B:l*m
    C=[[None for i in range(m)] for j in range(k)]

    for i in range(k):
        for j in range(m):
            ANS=0
            for pl in range(l):
                ANS=(ANS+A[i][pl]*B[pl][j])%mod

            C[i][j]=ANS

    return C

def plus(A,B,k,l):# a,B:k*l
    C=[[None for i in range(l)] for j in range(k)]

    for i in range(k):
        for j in range(l):
            C[i][j]=(A[i][j]+B[i][j])%mod

    return C

A,B=map(int,input().split())
C,D=map(int,input().split())

S,T=map(int,input().split())
n,mod=map(int,input().split())

M=[[A,B],[C,D]]

POWA=[M]

for i in range(60):
    POWA.append(prod(POWA[-1],POWA[-1],2,2,2)) # ベキを求めて

X=[[1,0],[0,1]]

while n:
    X=prod(X,POWA[n.bit_length()-1],2,2,2) # n乗の場合
    n-=1<<(n.bit_length()-1)

ANS=prod(X,[[S],[T]],2,2,1)

print(ANS[0][0]%mod,ANS[1][0]%mod)