#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;

#define pass (void)0
#define INF (1<<30)-1
#define INFLL (1LL<<60)-1
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define rep2(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define repr2(i, a, b) for (int i = (int)(b) - 1; i >= (int)(a); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define YesNo(cond) cout << ((cond) ? "Yes\n" : "No\n")
#define YESNO(cond) cout << ((cond) ? "YES\n" : "NO\n")

using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;

template <typename T> void print(const T& value) { cout << value << "\n"; }
template <typename T> void print(const vector<T>& vec) { for (auto& v : vec) cout << v << " "; cout << "\n"; }
template <typename T> void input(vector<T>& vec) { for (auto& v : vec) cin >> v; };
template <typename T> bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } return false; }
template <typename T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } return false; }

#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using vm = vector<mint>;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(10);

    int N, M;
    ll K;
    cin >> N >> M >> K;
    vl A(N);
    input(A);
    sort(all(A));

    vi R;
    int right = 0;
    rep (i, N) {
        while (right+1 < N && A[right+1]-A[i] <= K) {
            right ++;
        }
        R.push_back(right);
        if (right == i) right ++;
    }
    vi L;
    int left = N-1;
    repr (i, N) {
        while (1 <= left && A[i]-A[left-1] <= K) {
            left --;
        }
        L.push_back(left);
        if (left == i) left --;
    }
    reverse(all(L));

    vm dp(N+1, 0);
    rep (i, N) {
        dp[i+1] = i+1;
    }
    rep (i, M-1) {
        vm ndp;
        ndp.push_back(0);
        rep (j, N) {
            ndp.push_back(ndp[sz(ndp)-1]+(dp[R[j]+1]-dp[L[j]]));
        }
        dp = ndp;
    }

    print(dp[sz(dp)-1].val());
}