#include<bits/stdc++.h>
#define ll long long    
#define ull unsigned long long
#define db double
#define ldb long double
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define FR first
#define SE second
using namespace std;
inline int read() {
    int x = 0; bool op = 0;
    char c = getchar();
    while(!isdigit(c))op |= (c == '-'), c = getchar();
    while(isdigit(c))x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
    return op ? -x : x;
}
const int N = (1 << 20) + 10;
const int P = 998244353;
void add(int &a, int b) {a = (a + b) % P;}
void sub(int &a, int b) {a = (a - b + P) % P;}
int ksm(int x, int k) {
    int res = 1;
    for(int pw = x; k; (k & 1) ? res = 1ll * res * pw % P : 0, pw = 1ll * pw * pw % P, k >>= 1);
    return res;
}
int fac[N], ifac[N], pw[N], ipw[N];
void init() {
    fac[0] = ifac[0] = 1;
    for(int i = 1; i < N; i++)fac[i] = 1ll * fac[i - 1] * i % P;
    ifac[N - 1] = ksm(fac[N - 1], P - 2);
    for(int i = N - 2; i; i--)ifac[i] = 1ll * ifac[i + 1] * (i + 1) % P;
    for(int i = 1; i <= 20; i++)pw[1 << i] = ksm(3, (P - 1) / (1 << i));
    for(int i = 1; i <= 20; i++)ipw[1 << i] = ksm(pw[1 << i], P - 2);
    return ;
}
int inv(int x) {return 1ll * ifac[x] * fac[x - 1] % P;}
int rev[N];
void NTT(int *f, int len, int op) {
    for(int i = 0; i < len; i++)rev[i] = (rev[i >> 1] >> 1) | ((i & 1) * (len >> 1));
    for(int i = 0; i < len; i++)if(i < rev[i])swap(f[i], f[rev[i]]);
    for(int k = 2; k <= len; k <<= 1) {
        for(int i = 0; i < len; i += k) {
            int gn = (op == 1 ? pw[k] : ipw[k]), g = 1;
            for(int j = i; j < i + k / 2; j++, g = 1ll * g * gn % P) {
                int x = f[j], y = 1ll * g * f[j + k / 2] % P;
                f[j] = (x + y) % P; f[j + k / 2] = (x - y + P) % P;
            }
        }
    }
    if(op == -1) {
        for(int i = 0; i < len; i++) {
            f[i] = 1ll * f[i] * inv(len) % P;
        }
    }
    return ;
}
int k, p, dg, ans, a[3];
int f[N], g[N];
void cpy() {
    for(int i = 0; i <= dg; i++)g[i] = f[i];
    return ;
}
void calc(int x) {
    for(int i = 0; i <= dg; i++) {
        add(ans, 1ll * f[i] * abs(x + i - k) % P);
    }
    return ;
}
int main() { 
    init();
    for(int i = 0; i < 3; i++)a[i] = read();
    k = read(); p = read();
    f[0] = 1; f[1] = 1; f[2] = 1; dg = 2;
    int lim = 0; while((1 << (lim + 1)) <= k)lim++;
    for(int s = lim - 1; ~s; s--) {
        cpy();
        int ln = 1; while(ln < (dg << 1) + 5)ln <<= 1;
        NTT(f, ln, 1); NTT(g, ln, 1);
        for(int i = 0; i < ln; i++)f[i] = 1ll * f[i] * g[i] % P;
        NTT(f, ln, -1); dg <<= 1;
        for(int i = 0; i < ln; i++)g[i] = 0;
        // printf("now:%d %d\n", s, dg);
        // for(int i = 0; i <= dg; i++)printf("%d ", f[i]); putchar('\n');
        if(k >> s & 1) {
            for(int i = dg; ~i; i--) {
                add(f[i + 2], f[i]);
                add(f[i + 1], f[i]);
            }
            dg += 2;
        } 
    }
    // for(int i = 0; i <= 2 * k; i++)printf("%d ", f[i]); putchar('\n');
    calc(a[0] - a[1]); calc(a[1] - a[2]); calc(a[2] - a[0]);
    printf("%lld\n", 1ll * ans * ksm(2, P - 2) % P * ksm(ksm(3, k), P - 2) % P);
    return 0;
}