#include <bits/stdc++.h>
#define int long long
const int mod=998245353; 
using namespace std;
const int N=1e6+7;
int n,k,a[N],ans;
signed main(){
	freopen("maxmin.in","r",stdin);
	freopen("maxmin.out","w",stdout);
	
	cin>>n>>k;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	sort(a+1,a+n+1);

		for(int i=1;i<=n;i++){
			int l=1,r=n;
			int ansl,ansr;
			while(l<r){
				int mid=l+r>>1;
				if(a[mid]>=a[i]+k){
					r=mid;
				}
				else{
					l=mid+1;
				}
			}
			ansl=l;
			l=1,r=n;
			while(l<r){
				int mid=(l+r+1)>>1;
				if(a[mid]<=a[i]+k){
					l=mid;
				}
				else{
					r=mid-1;
				}
			}
			ansr=l;
			if(a[ansl]==a[ansr]){
				if(a[ansl]==a[i]+k){
					ans=(ans+((ansl+ansr)*(ansr-ansl+1)>>1)%mod-(ansr-ansl)*i%mod)%mod;
				}
			}
		}		
	

	cout<<ans;

	return 0;
}