#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
template<int mod>istream &operator>>(istream &is,static_modint<mod> &a){long long b;is>>b;a=b;return is;}
istream &operator>>(istream &is,modint &a){long long b;cin>>b;a=b;return is;}
#endif
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) static_cast<void>(0)
#define debugg(...) static_cast<void>(0)
template<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}
#endif
using ll=long long;
using ull=unsigned long long;
using P=pair<ll,ll>;
template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;
template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}
template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}
template<typename T1,typename T2>istream &operator>>(istream &is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}
template<typename T>istream &operator>>(istream &is,vector<T> &a){for(auto &i:a)is>>i;return is;}
template<typename T1,typename T2>void operator++(pair<T1,T2>&a,int n){a.first++,a.second++;}
template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int n){a.first--,a.second--;}
template<typename T>void operator++(vector<T>&a,int n){for(auto &i:a)i++;}
template<typename T>void operator--(vector<T>&a,int n){for(auto &i:a)i--;}
#define reps(i,a,n) for(int i=(a);i<(n);i++)
#define rep(i,n) reps(i,0,n)
#define all(x) x.begin(),x.end()
#define pcnt(x) __builtin_popcountll(x)
#define fin(x) return cout<<x<<'\n',static_cast<void>(0)
ll myceil(ll a,ll b){return (a+b-1)/b;}
template<typename T,size_t n,size_t id=0>
auto vec(const int (&d)[n],const T &init=T()){
  if constexpr (id<n)return vector(d[id],vec<T,n,id+1>(d,init));
  else return init;
}
void SOLVE();
int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout<<fixed<<setprecision(16);
  #ifdef LOCAL
  clock_t start=clock();
  #endif
  int testcase=1;
  //cin>>testcase;
  for(int i=0;i<testcase;i++){
    SOLVE();
  }
  #ifdef LOCAL
  cerr<<"time:";
  cerr<<(clock()-start)/1000;
  cerr<<"ms\n";
  #endif
}
using mint=modint998244353;
void SOLVE(){
  int x,y;
  ll t;
  int a,b,c,d;
  cin>>x>>y>>t>>a>>b>>c>>d;
  a--,b--,c--,d--;
  vector<vector<mint>>f(1<<(x+1),vector<mint>(1<<(y+1),0));
  f[a][b]=1;
  f[(1<<(x+1))-2-a][b]=-1;
  f[a][(1<<(y+1))-2-b]=-1;
  f[(1<<(x+1))-2-a][(1<<(y+1))-2-b]=1;
  vector<vector<mint>>g(1<<(x+1),vector<mint>(1<<(y+1),0));
  g[0][0]=1;
  g[0][1]=1;
  g[1][0]=1;
  g[(1<<(x+1))-1][0]=1;
  g[0][(1<<(y+1))-1]=1;
  auto dft2d=[&](vector<vector<mint>>&v)->void {
    rep(i,v.size())internal::butterfly(v[i]);
    int ny=v[0].size();
    rep(j,ny){
      vector<mint>temp(v.size());
      rep(i,v.size())temp[i]=v[i][j];
      internal::butterfly(temp);
      rep(i,v.size())v[i][j]=temp[i];
    }
  };
  auto idft2d=[&](vector<vector<mint>>&v)->void {
    int ny=v[0].size();
    mint inv=mint(ny).inv();
    rep(i,v.size()){
      internal::butterfly_inv(v[i]);
      rep(j,ny)v[i][j]*=inv;
    }
    inv=mint(v.size()).inv();
    rep(j,ny){
      vector<mint>temp(v.size());
      rep(i,v.size())temp[i]=v[i][j];
      internal::butterfly_inv(temp);
      rep(i,v.size())v[i][j]=temp[i]*inv;
    }
  };
  dft2d(f);
  dft2d(g);
  rep(i,1<<(x+1))rep(j,1<<(y+1)){
    f[i][j]*=g[i][j].pow(t);
  }
  idft2d(f);
  cout<<f[c][d].val()<<endl;
}