#include<bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)

ULL powm(ULL a,ULL i,ULL M) {
  ULL r=1;
  while(i){ if(i%2) r=r*a%M; a=a*a%M; i/=2; }
  return r;
}

void NTT(vector<ULL>& A,ULL M,ULL g){
  int N=A.size();
  for(int i=0,j=0; j<N; j++){
    if(i<j) swap(A[i],A[j]);
    for(int k=N>>1; k>(i^=k); k>>=1);
  }
  for(int i=1; i<N; i<<=1){
    ULL q=powm(g,(M-1)/i/2,M), qj=1;
    rep(k,N){
      ULL l=A[k],r=A[k+i]*qj%M;
      A[k]=(l+r); if(A[k]>=M) A[k]-=M;
      A[k+i]=(l+M-r); if(A[k+i]>=M) A[k+i]-=M;
      qj=qj*q%M;
      if((k+1)&i){ qj=1; k+=i; }
    }
  }
}

int X,Y;
int XX,YY;
ULL T;
int Sx,Sy,Gx,Gy;

void NTT_dp(vector<ULL>& a,ULL M,ULL g){
  vector<ULL> x(YY);
  rep(i,XX){
    rep(j,YY) x[j]=a[i*YY+j];
    NTT(x,M,g);
    rep(j,YY) a[i*YY+j]=x[j];
  }
  x.resize(XX);
  rep(i,YY){
    rep(j,XX) x[j]=a[j*YY+i];
    NTT(x,M,g);
    rep(j,XX) a[j*YY+i]=x[j];
  }
}

const ULL M=998244353;
const ULL g=3;

vector<ULL> G;
vector<ULL> dp;

int main() {
  cin>>X>>Y>>T>>Sy>>Sx>>Gy>>Gx; Sx--; Sy--; Gx--; Gy--;
  XX=1<<(X+1), YY=1<<(Y+1);
  G.assign(XX*YY,0);
  dp.assign(XX*YY,0);
  G[0]=1;
  G[1]=1;
  G[YY-1]=1;
  G[YY]=1;
  G[(XX-1)*YY]=1;
  dp[Sy*YY+Sx]=1;
  dp[(XX-2-Sy)*YY+Sx]=M-1;
  dp[Sy*YY+(YY-2-Sx)]=M-1;
  dp[(XX-2-Sy)*YY+(YY-2-Sx)]=1;
  NTT_dp(G,M,g); NTT_dp(dp,M,g);
  rep(i,XX*YY) dp[i]=dp[i]*powm(G[i],T,M)%M;
  NTT_dp(dp,M,powm(g,M-2,M));
  printf("%llu\n",dp[Gy*YY+Gx]*powm(M/2+1,X+Y+2,M)%M);
  return 0;
}