mod = 998244353

h,w,sy,sx,gy,gx,KK = list(map(int,input().split()))
sy,sx,gy,gx = sy-1,sx-1,gy-1,gx-1
hw = h*w
s = [[[0 for i in range(2**hw)] for u in range(hw)]for k in range(hw)]

for y in range(h):
    for x in range(w):
        xy = y*w+x
        for Y in range(h):
            for X in range(w):
                XY = Y*w+X
                if xy == XY:
                    continue
                if y == Y or x == X or x+y == X+Y or x-y == X-Y:
                    s[xy][XY][1<<XY] = 1

for i in range(hw):
    for bit in range(2**hw):
        for y in range(h):
            for x in range(w):
                xy = y*w+x
                if bit&(1<<xy) == 0:
                    continue
                for Y in range(h):
                    for X in range(w):
                        XY = Y*w+X
                        if bit&(1<<XY):
                            continue
                        if y == Y or x == X or x+y == X+Y or x-y == X-Y:
                            s[i][XY][bit|(1<<XY)] += s[i][xy][bit]
                            s[i][XY][bit|(1<<XY)] %= mod

t = [[s[i][u][2**hw-1] for u in range(hw)] for i in range(hw)]
out = [0 for i in range(hw)]
out[sy*w+sx] = 1
K = KK//hw

while K:
    if K&1:
        a = [0 for i in range(hw)]
        for i in range(hw):
            for u in range(hw):
                a[u] += out[i]*t[i][u]
                a[u] %= mod
        out = a[:]
    
    b = [[0 for i in range(hw)] for u in range(hw)]
    
    for i in range(hw):
        for u in range(hw):
            for k in range(hw):
                b[i][k] += t[i][u]*t[u][k]
                b[i][k] %= mod
    
    t = b[:]
    K //= 2

K = KK%hw
ans = 0

if K:
    for bit in range(2**hw):
        c = 0
        for i in range(hw):
            if bit&(1<<i):
                c += 1
        if c != K:
            continue
        
        for i in range(hw):
            ans += out[i]*s[i][gy*w+gx][bit]
            ans %= mod

elif K == 0:
    ans += out[gy*w+gx]
    ans %= mod

print(ans)