#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
using ll=long long;
typedef pair<int, int> P;
const ll MOD=998244353;
ll powmod(ll a, ll k){
    ll ap=a, ans=1;
    while(k){
        if(k&1){
            ans*=ap;
            ans%=MOD;
        }
        ap=ap*ap;
        ap%=MOD;
        k>>=1;
    }
    return ans;
}
ll inv(ll a){
    return powmod(a, MOD-2);
}
const ll r=3;
struct NTT{
	ll zeta[24];
	NTT(){
		zeta[23]=powmod(r, (MOD-1)>>23);
		for(int i=22; i>=0; i--) zeta[i]=zeta[i+1]*zeta[i+1]%MOD;
	}
	vector<ll> fft(vector<ll> a, int k, bool inverse=false){
		int n=a.size();
		vector<ll> tmp(n);
		for(int t=1; t<=k; t++){
			ll w=1, z=zeta[t];
			if(inverse) z=inv(z);
			for(int i=0; i<n; i++){
				int l=i&((1<<(k-t))-1), h=i&~((1<<(k-t))-1);
				tmp[i]=(a[((h<<1)|l)&(n-1)]+w*a[((h<<1)|l|(1<<(k-t)))&(n-1)])%MOD;
				if((i&((1<<(k-t))-1))==(1<<(k-t))-1) (w*=z)%=MOD;
			}
			swap(a, tmp);
		}
		if(inverse){
			ll invn=inv(n);
			for(int i=0; i<n; i++) (a[i]*=invn)%=MOD;
		}
		return a;
	}
	vector<ll> multiply(vector<ll> a, vector<ll> b){
		int n=a.size()+b.size()-1, k=0;
		while((1<<k)<n) k++;
		n=(1<<k);
		a.resize(n), b.resize(n);
		a=fft(a, k), b=fft(b, k);
		vector<ll> c(n);
		for(int i=0; i<n; i++) c[i]=a[i]*b[i]%MOD;
		c=fft(c, k, true);
		return c;
	}
};
NTT ntt;
vector<vector<ll>> fft_2d(vector<vector<ll>> v, int n, int m, bool inverse=false){
    vector<vector<ll>> fv(1<<n);
    for(int i=0; i<(1<<n); i++) fv[i]=ntt.fft(v[i], m, inverse);
    for(int j=0; j<(1<<m); j++){
        vector<ll> vh(1<<n);
        for(int i=0; i<(1<<n); i++) vh[i]=fv[i][j];
        vh=ntt.fft(vh, n, inverse);
        for(int i=0; i<(1<<n); i++) fv[i][j]=vh[i];
    }
    return fv;
}
int main()
{
    int x, y;
    ll t;
    int a, b, c, d;
    cin>>x>>y>>t>>a>>b>>c>>d;
    vector<vector<ll>> v(1<<(x+1), vector<ll>(1<<(y+1)));
    v[0][0]=v[1][0]=v[0][1]=v[(1<<(x+1))-1][0]=v[0][(1<<(y+1))-1]=1;
    //v[a][b]=1, v[(1<<(x+1))-a][b]=MOD-1, v[a][(1<<(y+1))-b]=MOD-1, v[(1<<(x+1))-a][(1<<(y+1))-b]=1;
    auto fv=fft_2d(v, x+1, y+1);
    for(int i=0; i<(1<<(x+1)); i++){
        for(int j=0; j<(1<<(y+1)); j++){
            fv[i][j]=powmod(fv[i][j], t);
        }
    }
    auto vp=fft_2d(fv, x+1, y+1, true);
    int a1[4]={a, (1<<(x+1))-a, (1<<(x+1))-a, a};
    int b1[4]={b, (1<<(y+1))-b, b, (1<<(y+1))-b};
    int maskx=(1<<(x+1))-1, masky=(1<<(y+1))-1;
    ll ans=0;
    for(int i=0; i<4; i++){
        ll z=vp[(c-a1[i]+(1<<(x+1)))&maskx][(d-b1[i]+(1<<(y+1)))&masky];
        if(i<2) ans+=z;
        else ans+=MOD-z;
    }
    ans%=MOD;
    cout<<ans<<endl;
    return 0;
}