import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;

public class Main {
	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String[] sa = br.readLine().split(" ");
		int n = Integer.parseInt(sa[0]);
		int m = Integer.parseInt(sa[1]);
		int k = Integer.parseInt(sa[2]);
		sa = br.readLine().split(" ");
		int[] a = new int[n];
		for (int i = 0; i < n; i++) {
			a[i] = Integer.parseInt(sa[i]);
		}
		br.close();

		Arrays.sort(a);
		int[] l = new int[n];
		int[] r = new int[n];
		for (int i = 0; i < n; i++) {
			l[i] = binarySearchL(a, a[i] - k);
			r[i] = binarySearchR(a, a[i] + k) + 1;
		}

		int mod = 998244353;
		long[] dp = new long[n + 1];
		for (int i = 1; i <= n; i++) {
			dp[i] = i;
		}
		for (int i = 1; i < m; i++) {
			long[] wk = new long[n + 1];
			for (int j = 0; j < n; j++) {
				wk[j + 1] = dp[r[j]] - dp[l[j]] + mod;
				wk[j + 1] += wk[j];
				wk[j + 1] %= mod;
			}
			dp = wk;
		}
		System.out.println(dp[n]);
	}

	static int binarySearchL(int[] array, int val) {
		int ok = array.length;
		int ng = -1;
		while (Math.abs(ok - ng) > 1) {
			int mid = (ok + ng) / 2;
			if (array[mid] >= val) {
				ok = mid;
			} else {
				ng = mid;
			}
		}
		return ok;
	}

	static int binarySearchR(int[] array, int val) {
		int ng = array.length;
		int ok = -1;
		while (Math.abs(ok - ng) > 1) {
			int mid = (ok + ng) / 2;
			if (array[mid] <= val) {
				ok = mid;
			} else {
				ng = mid;
			}
		}
		return ok;
	}
}