def matmul(A,B): # A,B: 行列
    res = [[0]*len(B[0]) for _ in [None]*len(A)]
    for i, resi in enumerate(res):
        for k, aik in enumerate(A[i]):
            for j,bkj in enumerate(B[k]):
                resi[j] += aik*bkj
                resi[j] %= MOD
    return res

def matpow(A,p): #A^p mod M
    if p%2:
        return matmul(A, matpow(A,p-1))
    elif p > 0:
        b = matpow(A,p//2)
        return matmul(b,b)
    else:
        return [[int(i==j) for j in range(len(A))] for i in range(len(A))]

MOD = 998244353
m,n,s = map(int,input().split())
p = m*pow(n,MOD-2,MOD)%MOD
m,n,t = map(int,input().split())
q = m*pow(n,MOD-2,MOD)%MOD

"""
[-t,...0,...,s]
offset = -t
"""
N = s+t+1
N2 = 2*N

A = [[0]*N2 for _ in range(N2)]
A[0][N] = 1
for i in range(1,N):
    A[i][i+N] = v = 1-p
    for j in range(i+1,N):
        v = v*p%MOD
        A[i][j+N] = v
    A[i][N2-1] = pow(p,N-i-1,MOD)
    
B = [[0]*N2 for _ in range(N2)]
B[N2-1][N-1] = 1
for i in range(N-1):
    B[i+N][i] = v = 1-q
    for j in range(i)[::-1]:
        v = v*q%MOD
        B[i+N][j] = v
    B[i+N][0] = pow(q,i,MOD)

C = matmul(A,B)
C = matpow(C,int(input()))
v = C[t]
print(v[N-1]%MOD)
print(v[0]%MOD)