from sys import stdin,setrecursionlimit#,set_int_max_str_digits
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
# setrecursionlimit(2000000) # これこどふぉだと無理
# set_int_max_str_digits(200010)
mod = 998244353 
ii = lambda :int(stdin.readline())
mi = lambda :map(int,stdin.readline().split())
li = lambda :list(mi())
gmi = lambda :map(lambda x: int(x) - 1, stdin.readline().split())
gi = lambda :list(map(lambda x: 0 if x == "." else 1,input())) # グリッド入力受け取り
py = lambda :print("Yes")
pn = lambda :print("No")
pf = lambda :print("First") 
ps = lambda :print("Second")
pyn = lambda x: print("Yes") if x else print("No")
vec = [(1,0),(-1,0),(0,-1),(0,1)]
vec1 = [(1,0),(1,1),(0,1),(-1,1),(-1,0),(-1,-1),(0,-1),(1,-1)] #8方向
vec2 = [(1,1),(1,0),(0,-1),(-1,-1),(-1,0),(0,1)] # 六角形グリッド
inf = 10**18
from collections import defaultdict,deque
from heapq import heappop,heappush
# from random import randint
from itertools import permutations 


n,m,k = mi()
a = li() 
a.sort()

data = []

for i,x in enumerate(a):
    # 左端
    ok = i 
    ng = -1 
    while abs(ok-ng) > 1:
        mid = (ok+ng)//2 
        if abs(x - a[mid]) <= k:
            ok = mid 
        else:
            ng = mid 
    left = ok 
    ok = i 
    ng = n 
    while abs(ok-ng) > 1:
        mid = (ok+ng)//2 
        if abs(x - a[mid]) <= k:
            ok = mid 
        else:
            ng = mid     
    data.append((left,ok))

dp = [1]*n 
for _ in range(m-1):
    pre_dp = [i for i in dp]
    for i in range(1,n):
        pre_dp[i] += pre_dp[i-1]
        pre_dp[i] %= mod 
    pre_dp.append(0) 
    for i in range(n):
        l,r = data[i] 
        dp[i] = (pre_dp[r] - pre_dp[l-1]) % mod 
    


print(sum(dp) % mod)