#include <algorithm>
#include <iostream>
#include <map>
using namespace std;
const int N = 2e5 + 5, p = 998245353;
int a[N];
map<int, int> mp;
int ksm(int x, int y) {
    if (y == 1) return x;
    if (y == 0) return 1;
    long long te = ksm(x, y / 2);
    if (y & 1)
        return ((te * te) % p) * x % p;
    else
        return (te * te) % p;
}
int main() {
    freopen("maxmin.in", "r", stdin);
    freopen("maxmin.out", "w", stdout);
    // cout << ksm(1024, 10) << endl;
    int n, k;
    cin >> n >> k;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    sort(a + 1, a + 1 + n);
    for (int i = n; i >= 1; i--) {
        mp[a[i]] = i;
    }
    long long ans = 0;
    for (int i = n; i >= 1; i--) {
        int j = a[i] - k;
        if (j <= 0) break;
        if (!mp.count(j)) continue;
        j = mp[j];
        // cout << i << " " << j << endl;
        ans += ksm(2, i - j - 1);
        ans %= p;
    }
    cout << ans;
    return 0;
}