#include<iostream>
#include<algorithm>
using namespace std;
int d[500005];
int n,a,b,c,low,high,mid,cnt;
int AC(){
	cin>>n>>c;
	for(int i=1;i<=n;i++){
		cin>>d[i];
	}
	
	sort(a+1,a+n+1);
	for(int i=1;i<=n;i++){
		a=d[i];
		low=1;
		high=n;
		while(low<=high){
			mid=(low+high)/2;
			if(a-c<=a[mid]){
				high=mid-1;
			}
			else{
				low=mid+1;
			}
			if(a[low]==x){
				cout<<low<<" ";
			}
			else{
				cout<<-1<<" ";
			}
		}
		if(a[low]==a-c){
			cnt++
		}
	}
	cout<<cnt;
	return 0;
}