#include <iostream>
#include <set>
#include <cstdio>
#include <map>
#include <cstring>
#include <cstdio>
#include <cctype>
#include <queue>
#include <vector>
#include <algorithm>
#include <set>
#include <cmath>
using namespace std;
typedef long long LL;
const double ans=1e-6;
const int maxn=1000+10;
int main(){
int r,n;
while(cin>>r>>n&&r!=-1&&n!=-1){
int arr[maxn];
for(int i=0;i<n;i++){
cin>>arr[i];
}
sort(arr,arr+n);
int ans=0,index;
int left=0,right=0;
while(left<n){
index=arr[left]+r;
//int temp=left;
while(arr[left]<=index) left++;
// if(temp!=left)
ans++;
index=arr[left-1]+r;
while(arr[left]<=index) left++;
}
cout<<ans<<endl;
}
}