POJ 3069

#include<iostream>
#include<algorithm>
using namespace std;

const int MAXN=1005;
int R, n, X[MAXN];

int main(void){
	while(1){
		cin>>R>>n;
		if(R==n&&R==-1)
			break;

		for(int i=0;i<n;++i)
			cin>>X[i];
		sort(X,X+n);

		int i=0,num=0;
		while(i<n){
			int begin=X[i++];
			while(i<n&&X[i]<=begin+R) i++;
			int label=X[i-1];
			while(i<n&&X[i]<=label+R) i++;
			num++;
		}

		cout<<num<<endl;
	}
	
	
	return 0;
}