#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define N 200005
#define int long long
#define ul unsigned long long
#define db double
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
int n,m,a[N],t[N],sum[N],ans;const int mod=998245353; 
void swap(int &x,int &y){int t=x;x=y;y=t;}
int max(int x,int y){return x>y?x:y;}
int min(int x,int y){return x<y?x:y;}
int mo(int x){x%=mod;x+=mod;return x>=mod?x-mod:x;}
int read(){
	int sum=0;bool f=0;char c=getchar();
	for(;c<48||c>57;c=getchar())if(c==45)f=1;
	for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
	return f?-sum:sum;
}
signed main(){
	freopen("maxmin.in","r",stdin);freopen("maxmin.out","w",stdout);
	t[0]=sum[0]=1;fo(i,1,N-1)t[i]=t[i-1]*2%mod,sum[i]=(sum[i-1]+t[i])%mod;
	n=read();m=read();fo(i,1,n)a[i]=read();
	sort(a+1,a+n+1);
	for(int i=1,j=1;i<=n;i++)
	{
		while(j<i&&a[i]-a[j]>m)j++;
		if(a[i]-a[j]==m)
		{
			int ca=0,cb=0,x=i,y=j;
			while(i<n&&a[i]==a[i+1])i++,ca++;
			while(j<i&&a[j]==a[j+1])j++,cb++;
			if(!m)ans=mo(ans+t[ca+1]-1);
			else ans=mo(ans+sum[ca]*sum[cb]%mod*t[x-j-1]);
		}
	}
	printf("%lld",ans);
	return 0;
}