#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const ll MOD = 998244353;
const ll N = 8e5 + 10;
const ll root = 62;


ll fast_pow(ll base, ll exp){
    if(!exp) return 1ll;
    if(exp & 1ll) return base * fast_pow(base, exp - 1) % MOD;
    ll t = fast_pow(base, exp >> 1);
    return t * t % MOD;
}

typedef vector<ll> vl;
void ntt(vl &a){
    int n = a.size(), L = 31 - __builtin_clz(n);
    static vl rt(2, 1);
    for(static int k = 2, s = 2; k < n; k *= 2, ++s){
        rt.resize(n);
        ll z[] = {1, fast_pow(root, MOD >> s)};
        for(int i = k; i < 2 * k; ++i)
            rt[i] = rt[i / 2] * z[i & 1] % MOD;
    }

    vector<int> rev(n);
    for(int i = 0; i < n; ++i)
        rev[i] = (rev[i / 2] | (i & 1) << L) / 2;
    for(int i = 0; i < n; ++i)
        if(i < rev[i])
            swap(a[i],  a[rev[i]]);

    for(int k = 1; k < n; k *= 2){
        for(int i = 0; i < n; i += 2 * k){
            for(int j = 0; j < k; ++j){
                ll z = rt[j + k] * a[i + j + k] % MOD, &ai = a[i + j];
                a[i + j + k] = ai - z + (z > ai ? MOD : 0);
                ai += (ai + z >= MOD ? z - MOD : z);
            }
        }
    }
}

vl conv(const vl &a, const vl &b){
    if(a.empty() || b.empty()) return {};
    int s = a.size() + b.size() - 1, B = 32 - __builtin_clz(s), n = 1 << B;
    int inv = fast_pow(n, MOD - 2);
    vl L(a), R(b), out(n);
    L.resize(n), R.resize(n);
    ntt(L), ntt(R);
    for(int i = 0; i < n; ++i)
        out[-i & (n - 1)] = (ll)L[i] * R[i] % MOD * inv % MOD;
    ntt(out);
    return {out.begin(), out.begin() + s};
}

ll f[N], inv_f[N];
ll x1, x2, x3;
ll k, p;

vector<ll> v;

vl pol_pow(vl base, ll exp){
    vl ans{1};
    while(exp){
        if(exp & 1) ans = conv(ans, base);
        exp >>= 1;
        base = conv(base, base);
    }
    return ans;
}

ll comb(ll n, ll k){
    return f[n] * inv_f[k] % MOD * inv_f[n - k] % MOD;
}

ll expected(ll diff){
    ll res = 0;
    for(ll i = diff - k; i <= diff + k; ++i){
        res += abs(i) * v[i - (diff - k)] % MOD;
    }
    res %= MOD;

    res = (res * (fast_pow(fast_pow(3, k), MOD - 2)) % MOD);
    return res;
} 

int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> x1 >> x2 >> x3 >> k >> p;

    f[0] = 1;
    for(int i = 1; i < N; ++i)
        f[i] = f[i - 1] * i % MOD;
    inv_f[N - 1] = fast_pow(f[N - 1], MOD - 2);
    for(int i = N - 2; i >= 0; --i)
        inv_f[i] = inv_f[i + 1] * (i + 1) % MOD;

    v = pol_pow({1, 1, 1}, k);

    ll res = expected(abs(x1 - x2)) + expected(abs(x1 - x3)) + expected(abs(x2 - x3));
    res %= MOD;
    res *= inv_f[2];
    res %= MOD;

    cout << res << "\n";
}