MOD = 998244353

def judge(a, b, c, d):
    return a == c or b == d or a+b == c+d or a-b == c-d

def encode(h, w):
    return h*W+w

def decode(n):
    return n//W, n%W

def func(start):
    dp = [[0]*(H*W) for _ in range(1<<(H*W))]
    dp[0][start] = 1
    for bit in range(1<<(H*W)):
        for i in range(H*W):
            if dp[bit][i] == 0: continue
            for j in range(H*W):
                if i == j: continue
                if not 1<<j & bit and F[i][j]:
                    dp[bit|1<<j][j] += dp[bit][i]
                    dp[bit|1<<j][j] %= MOD
    return dp[-1]

def matrix(a, b):
    ans = [[0]*len(b[0]) for _ in range(len(a))]
    for i in range(len(a)):
        for j in range(len(b[0])):
            for k in range(len(b)):
                ans[i][j] += a[i][k]*b[k][j]%MOD
                ans[i][j] %= MOD
    return ans

H, W, sx, sy, gx, gy, K = map(int, input().split())

sx, sy, gx, gy = sx-1, sy-1, gx-1, gy-1

F = [[False]*(H*W) for _ in range(H*W)]
for i in range(H*W):
    for j in range(H*W):
        if i == j: continue
        F[i][j] = judge(*decode(i), *decode(j))

mat = []
for i in range(H*W):
    mat.append(func(i))
mat = list(map(list, zip(*mat)))

ansM = [[0] for _ in range(H*W)]
ansM[encode(sx, sy)][0] = 1
cnt = K//(H*W)
for i in range(60):
    if 1<<i & cnt:
        ansM = matrix(mat, ansM)
    mat = matrix(mat, mat)

dp = [[0]*(H*W) for _ in range(1<<(H*W))]
ans = 0
for i in range(H*W):
    dp[0][i] = ansM[i][0]
for bit in range(1<<(H*W)):
    if bit.bit_count() == K%(H*W):
        ans += dp[bit][encode(gx, gy)]
        ans %= MOD
    for i in range(H*W):
        if dp[bit][i] == 0: continue
        for j in range(H*W):
            if i == j: continue
            if not 1<<j & bit and F[i][j]:
                dp[bit|1<<j][j] += dp[bit][i]
                dp[bit|1<<j][j] %= MOD

print(ans)