#ifndef DEBUG
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("tune=native")
#endif

#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;

using ll = long long;
using mint = modint998244353;
// using mint = modint1000000007;

template <typename T> using vec = vector<T>;
template <typename T> using pr = pair<T, T>;
template <typename T> using mipq = priority_queue<T, vec<T>, greater<T>>;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(i, n) for (auto i = decay_t<decltype(n)>{}; i < (n); i++)
#define rep2(i, l, r) for (auto i = (l); i < (r); i++)
#define rep3(i, l, r, d) for (auto i = (l); i < (r); i += (d))
#define rep(...) overload4(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(i, r, l) for (auto i = (r); i >= (l); i--)
template <class T> bool chmax(T& a, const T& b) { return a < b ? a = b, true : false; }
template <class T> bool chmin(T& a, const T& b) { return a > b ? a = b, true : false; }

constexpr int INF = 1 << 30;
constexpr ll LINF = 1LL << 60;

void solve();

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    cout << fixed << setprecision(15);
    int T = 1;
    // cin >> T;
    while (T--) solve();
}

vec<vec<mint>> mat_mul(const vec<vec<mint>>& a, const vec<vec<mint>>& b) {
    int n = a.size();
    vec res(n, vec<mint>(n));
    rep(i, n) rep(k, n) rep(j, n) res[i][j] += a[i][k] * b[k][j];
    return res;
}

vec<vec<mint>> mat_pow(vec<vec<mint>> a, ll k) {
    int n = a.size();
    vec res(n, vec<mint>(n));
    rep(i, n) res[i][i] = 1;
    while (k) {
        if (k & 1) res = mat_mul(res, a);
        a = mat_mul(a, a);
        k >>= 1;
    }
    return res;
}

void solve() {
    int H, W, SX, SY, GX, GY; ll K;
    cin >> H >> W >> SX >> SY >> GX >> GY >> K;
    SX--; SY--; GX--; GY--;

    int S = SX * W + SY, G = GX * W + GY, L = H * W;

    auto moveable = [&] (int s, int t) {
        int si = s / W, sj = s % W, ti = t / W, tj = t % W;
        return s != t and (si == ti or sj == tj or si + sj == ti + tj or si - sj == ti - tj);
    };

    vec dp(L, vec(1 << L, vec<mint>(L)));
    vec mat(L, vec<mint>(L));
    rep(s, L) {
        rep(i, L) if (moveable(s, i)) dp[s][1 << i][i] = 1;
        rep(bit, 1 << L) rep(i, L) if (bit >> i & 1) {
            if (dp[s][bit][i] == 0) continue;
            rep(j, L) if (not (bit >> j & 1) and moveable(i, j)) {
                dp[s][bit | 1 << j][j] += dp[s][bit][i];
            }
        }
        rep(i, L) mat[s][i] = dp[s][(1 << L) - 1][i];
    }

    mat = mat_pow(mat, K / L);
    K %= L;

    mint res = 0;
    rep(i, L) rep(bit, 1U << L) if (bit >> G & 1 and popcount(bit) == K) {
        res += mat[S][i] * dp[i][bit][G];
    }

    cout << res.val() << '\n';
}