#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define st first
#define nd second
using namespace std;
typedef pair<int,int> pr;
typedef vector<int> vi;
typedef long long ll;
const int NN=(1<<18)+5,mod=998244353;
int x[4],k,p;


#define rep(i,s,t) for(int i = s;i <= t;i ++)
int qpow(int a,int b){
    int ret=1;
    while(b){
        if(b&1)ret=(ll)ret*a%mod;
        a=(ll)a*a%mod;
        b>>=1;
    }
    return ret;
}
namespace NTT{
    const int g=3;


    int x[NN<<2],y[NN<<2],wn[NN<<2];
    void init()
    {
        rep(i,0,20)wn[i]=qpow(g,(mod-1)/(1<<i));
    }

    void brc(int *F,int len)
    {
        int j=len/2;
        rep(i,1,len-2){
            if(i<j)swap(F[i],F[j]);
            int k=len/2;
            while(j>=k) j-=k,k>>=1;
            if(j<k)j+=k;
        }
    }

    void NTT(int *F,int len,int t)
    {
        int id=0; brc(F,len);
        for(int h=2;h<=len;h<<=1)
        {
            id++;
            for(int j=0;j<len;j+=h)
            {
                int E=1;
                for(int k=j;k<j+h/2;k++)
                {
                    int u=F[k],v=(ll)E*F[k+h/2]%mod;
                    F[k]=(u+v)%mod,F[k+h/2]=((u-v)%mod+mod)%mod;
                    E=(ll)E*wn[id]%mod;
                }
            }
        }
        if(t==-1)
        {
            rep(i,1,len/2-1)swap(F[i],F[len-i]);
            ll inv=qpow(len,mod-2);
            rep(i,0,len-1)F[i]=(ll)F[i]%mod*inv%mod;
        }
    }
    void multiply(int *a,int len1,int *b,int len2)
    {
        int len=1;
        while(len<len1+len2)len<<=1;
        rep(i,len1,len-1)a[i]=0;
        rep(i,len2,len-1)b[i]=0;
        NTT(a,len,1); NTT(b,len,1);
        rep(i,0,len-1)a[i]=(ll)a[i]*b[i]%mod;
        NTT(a,len,-1);
    }
}

int inv[NN<<2],maxn=(NN<<2)-5;

void init(){
    inv[0]=inv[1]=1;
    rep(i,2,maxn)inv[i]=(mod-mod/i)*(ll)inv[mod%i]%mod;
    int len=1<<17;
    NTT::init();
}
int a[NN<<2],len;
int sol(int x){
    int ret=0;
    x=abs(x);
    for(int i=-k;i<=k;++i)ret=(ret+(ll)a[i+k]*abs(x+i))%mod;
    return ret;
}
int main(){
    scanf("%d%d%d",x+1,x+2,x+3);
    scanf("%d%d",&k,&p);
    init();
    a[0]=a[1]=a[2]=qpow(3,mod-2);
    for(int i=3;i<1<<19;++i)a[i]=0;
    NTT::NTT(a,1<<19,1);
    for(int i=0;i<1<<19;++i)a[i]=qpow(a[i],k);
    NTT::NTT(a,1<<19,-1);
    int ans=0;
    ans=((ll)sol(x[1]-x[2])+sol(x[2]-x[3])+sol(x[3]-x[1]))%mod*qpow(2,mod-2)%mod;
    printf("%d\n",ans);

    return 0;
}
/*
3
3 0
5 2
6 6
 */