#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N = (1<<20);
const int MOD = 998244353;

inline int add(int a, int b) {
  return (a + b) % MOD;
}
inline int sub(int a, int b) {
  a -= b;
  if (a < 0) a += MOD;
  return a;
}
inline int mul(int a, int b) {
  ll x = (ll)a * b;
  x %= MOD;
  return x;
}
inline int pw(int a, int k) {
  int res = 1;
  for (int bs = a; k > 0; k /= 2, bs = mul(bs, bs))
    if (k&1)
      res = mul(res, bs);
  return res;
}
inline int inv(int a) {
  return pw(a, MOD - 2);
}

int w[N];

void fftinit() {
  ll g = pw(3, (MOD - 1) / N);
  w[0] = 1;
  for (int i = 1; i < N; ++i)
    w[i] = mul(w[i - 1], g);
}

void fft(int p[], int n, bool fft_inv = false) {
  for (int i = 1, j = 0; i < n - 1; ++i) {
    for (int s = n; j ^= s >>= 1, ~j&s;);
    if (i < j) swap(p[i], p[j]);
  }
  for (int d = 0; (1 << d) < n; ++d) {
    int m = (1 << d), m2 = m * 2, rm = n >> (d + 1);
    for (int i = 0; i < n; i += m2) {
      for (int j = 0; j < m; ++j) {
        int x = p[i + j];
        int t = mul(w[rm * j], p[i + j + m]);
        p[i + j + m] = sub(x, t);
        p[i + j] = add(x, t);
      }
    }
  }
  if (fft_inv) {
    int ni = inv(n);
    reverse(p + 1, p + n);
    for (int i = 0; i < n; ++i)
      p[i] = mul(ni, p[i]);
  }
}

int f[N];

int main() {
  fftinit();
  int x1, x2, x3, k, p;
  cin >> x1 >> x2 >> x3 >> k >> p;
  f[0] = f[1] = f[2] = inv(3);
  fft(f, N);
  for (int i = 0; i < N; ++i)
    f[i] = pw(f[i], k);
  fft(f, N, true);
  int e12 = 0, e13 = 0, e23 = 0;
  for (int i = 0; i < N; ++i) {
    int d12 = abs(x1 - x2 + i - k);
    e12 = add(e12, mul(d12, f[i]));
    int d13 = abs(x1 - x3 + i - k);
    e13 = add(e13, mul(d13, f[i]));
    int d23 = abs(x2 - x3 + i - k);
    e23 = add(e23, mul(d23, f[i]));
  }
  int ans = add(e12, add(e13, e23));
  ans = mul(ans, inv(2));
  cout << ans << endl;
}