C++ :

#include<iostream>
#include<algorithm>
using namespace std;
int n,m,k,a[1008],l;
int main()
{
	cin>>n>>m>>k;
	for (int i=1;i<=n;i++)
	cin>>a[i];
	sort(a,a+n+1);
	for (int i=1;i<=n;i++)
	if (a[i]<=m) {l++;m+=k;}
	cout<<l<<endl;
	return 0;
}