#include<iostream>
#include<algorithm>
using namespace std;
typedef long long LL;
const LL N = 1e6+100,mod = 998244353;
LL f[N][2][2];
LL h,w,k;
LL x1,x2,y1,y2;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    cin>>h>>w>>k;
    cin>>x1>>y1>>x2>>y2;

    f[0][x1==x2][y1==y2] = 1;
    for(int i=1; i<=k; i++) {
        f[i][0][0] = (1LL * f[i-1][1][0] * (h-1) + 1LL * f[i-1][0][1] * (w-1) + 1LL * f[i-1][0][0] * (h+w-4)) % mod;
        f[i][0][1] = (1LL * f[i-1][0][0] + 1LL * f[i-1][1][1] * (h-1) + 1LL * f[i-1][0][1] * (h-2)) % mod;
        f[i][1][0] = (1LL * f[i-1][0][0] + 1LL * f[i-1][1][1] * (w-1) + 1LL * f[i-1][1][0] * (w-2)) % mod;
        f[i][1][1] = (1LL * f[i-1][1][0] + 1LL * f[i-1][0][1]) % mod;
    }

    cout << f[k][1][1] << endl;
    return 0;
}