#include<bits/stdc++.h>
using namespace std;
const int N=4e6+5,M=998244353;
int x,y,z,k,p,R[N],ans;
void ck(int &x){(x>=M)&&(x-=M);}
void kc(int &x){(x<0)&&(x+=M);}
int pw(int x,int t){
    int rs=1;
    for(;t;t>>=1,x=1ll*x*x%M)if(t&1)rs=1ll*rs*x%M;
    return rs;
}
void NTT(vector<int> &a,int tp){
	int up=a.size();
	for(int i=0;i<up;++i)R[i]=(R[i>>1]| ((i&1)? up:0))>>1;
	for(int i=1;i<up;++i)if(i<R[i])swap(a[i],a[R[i]]);
	for(int i=1;i<up;i<<=1){
		int Wn=pw(tp? 3:((M+1)/3),(M-1)/i/2);
		for(int o=0;o<up;o+=i){
			for(int w=1,U=o+i;o<U;++o,w=1ll*w*Wn%M){
				int x=a[o],y=1ll*w*a[o+i]%M;
				ck(a[o]=x+y);kc(a[o+i]=x-y);
			}
		}
	}
	if(!tp){
		int k=pw(up,M-2);
		for(int i=0;i<up;++i)a[i]=1ll*a[i]*k%M;
	}
}
vector<int> slv(int l,int r){
    // printf("__%d %d\n",l,r);
	if(l==r){
		vector<int>A;
		A.push_back(332748118);
		A.push_back(332748118);
        A.push_back(332748118);
        A.push_back(0);
		return A;
	}
	int mid=(l+r)>>1;
	vector<int> x=slv(l,mid),y=slv(mid+1,r);
	int sz=max(x.size(),y.size())<<1;
	x.resize(sz),y.resize(sz);

	NTT(x,1),NTT(y,1);
	for(int i=0;i<sz;++i)x[i]=1ll*x[i]*y[i]%M;
	NTT(x,0);
	return x;
}
vector<int>rs;
void clc(int d){
    for(int i=0;i<=2*k;++i){
        ans=(ans+1ll*abs(d+i-k)*rs[i])%M;
    }
}
int main(){
    scanf("%d %d %d %d %d",&x,&y,&z,&k,&p);
    // puts("___");
    rs=slv(1,k);
    clc(abs(x-y)),clc(abs(y-z)),clc(abs(z-x));
    // puts("___");
    ans=1ll*ans*pw(2,M-2)%M;
    printf("%d\n",ans);
}