#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m, k;
  cin >> n >> m >> k;
  VI a(n);
  rep(i, n) cin >> a[i];
  sort(all(a));
  vector<P> lr(n);
  rep(i, n) {
    int l = lower_bound(all(a), a[i] - k) - a.begin();
    int r = upper_bound(all(a), a[i] + k) - a.begin();
    lr[i] = {l, r};
  }
  vector<mint> dp(n, 1), ndp;
  rep(_, m - 1) {
    ndp.assign(n + 1, 0);
    rep(i, n) {
      auto [l, r] = lr[i];
      mint v = dp[i];
      ndp[l] += v;
      ndp[r] -= v;
    }
    rep(i, n) ndp[i+1] += ndp[i];
    ndp.pop_back();
    swap(dp, ndp);
  }
  mint ans = accumulate(all(dp), mint());
  cout << ans.val() << '\n';
}