n,m,k=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
pl=[0]*n
pr=[0]*n
l=0
r=0
for i in range(n):
  while l<i and a[i]-a[l]>k:
    l+=1
  r=max(r,i)
  while r+1<n and a[r+1]-a[i]<=k:
    r+=1
  pl[i],pr[i]=l,r
q=[1]*n
M=998244353
for _ in range(1,m):
  q+=[0]
  for i in range(n):
    q[i]+=q[i-1]
  q=[(q[pr[i]]-q[pl[i]-1])%M for i in range(n)]
print(sum(q)%M)