#include<bits/stdc++.h>
using namespace std;

#define maxn 200005
#define ll long long
const ll mod=998245353;

ll n,k;
ll num[maxn];
struct node{
	ll a,b;
};
map<ll,node>m;
ll ans=0;

ll qpow(ll u){
	ll sum=1,x=2;
	while(u>0){
		if(u&1){
			sum*=x;
			sum%=mod;
		}
		x*=x;
		x%=mod;
		u>>=1;
	}
	return sum;
}


int main(){
	
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	
	freopen("maxmin.in","r",stdin);
	freopen("maxmin.out","w",stdout);
	
	
	cin>>n>>k;
	
	for(int i=1;i<=n;i++){
		cin>>num[i];
	}
	
	sort(num+1,num+1+n);
	
	
	for(int i=1;i<=n+1;i++){
		if(num[i]!=num[i-1]){
			m[num[i]].a=i;
			m[num[i-1]].b=i-1;
		}
	}
	
	
	for(int i=1;i<=n;i=m[num[i]].b+1){
		if(m[num[i]+k].a!=0){
			ll x=qpow(m[num[i]].b-m[num[i]].a+1)-1;
			ll y=qpow(m[num[i]+k].a-m[num[i]].b-1);
			ll z=qpow(m[num[i]+k].b-m[num[i]+k].a+1)-1;
			z*=(x*y)%mod;
			z%=mod;
			ans+=z;
			ans%=mod;
		}
	}
	cout<<ans;
	
	
	
	
	return 0;
}