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

using namespace std;
using namespace atcoder;
using ll = long long;

template<ll modc>
class modint {
    ll x;
public:
    modint(ll x=0) : x((x%modc+modc)%modc) {}
    modint operator-() const {
      return modint(-x);
    }
    modint& operator+=(const modint& a) {
        if ((x += a.x) >= modc) x -= modc;
        return *this;
    }
    modint& operator-=(const modint& a) {
        if ((x += modc-a.x) >= modc) x -= modc;
        return *this;
    }
    modint& operator*=(const  modint& a) {
        (x *= a.x) %= modc;
        return *this;
    }
    modint operator+(const modint& a) const {
        modint res(*this);
        return res+=a;
    }
    modint operator-(const modint& a) const {
        modint res(*this);
        return res-=a;
    }
    modint operator*(const modint& a) const {
        modint res(*this);
        return res*=a;
    }
    modint pow(ll t) const {
        if (!t) return 1;
        modint a = pow(t>>1);
        a *= a;
        if (t&1) a *= *this;
        return a;
    }
    modint inv() const {
        return pow(modc-2);
    }
    modint& operator/=(const modint& a) {
        return (*this) *= a.inv();
    }
    modint operator/(const modint& a) const {
        modint res(*this);
        return res/=a;
    }
    bool operator == (const modint& a) const{
        return x == a.x;
    }
    friend ostream& operator<<(ostream& os, const modint& m){
        os << m.x;
        return os;
    }
    friend istream& operator>>(istream& ip, modint &m) {
        ll t;
        ip >> t;
        m = modint(t);
        return ip;
    }
    ll val(){
        return x;
    }
};

int main(){

    ll H, W, N, K, mi, K2;
    cin >> H >> W >> N >> K;
    using mint = modint998244353;
    vector<mint> ch(K+1), cw(K+1);

    if (K*2 <= H){
        for (int i=1; i<=K; i++) ch[i] += 2;
        ch[K] += H-K*2;
    }
    else{
        for (int i=1; i<=H-K; i++) ch[i] += 2;
        ch[H-K+1] += H-(H-K)*2;
    }
    if (K*2 <= W){
        for (int i=1; i<=K; i++) cw[i] += 2;
        cw[K] += W-K*2;
    }
    else{
        for (int i=1; i<=W-K; i++) cw[i] += 2;
        cw[W-K+1] += W-(W-K)*2;
    }

    mint ans=0, M = (H-K+1) * (W-K+1), Minv = M.inv();

    for (int i=1; i<=K; i++){
        for (int j=1; j<=K; j++) ans += ch[i] * cw[j] * (mint(1) - ((M-i*j)*Minv).pow(N));
    }

    cout << ans.val() << endl;

    return 0;
}