#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
#include <vector>
using namespace std;

int find(int n){
	int p[n];
	memset(p, false, sizeof(p));
	int ans=0;
	for(int i=2;i<n;i++){
		if(p[i]==false){
			//a[k++]=i;
			ans++;
			for(int j=i+i;j<n;j+=i){
				p[j]=true;
			}
		}
	}
	return ans;
}
int main() {
	int n,m;
	while(cin>>n>>m){
		int ans=find(n);
		cout<<ans<<endl;
		if(m>=ans)cout<<"YES"<<endl;
		else cout<<"NO"<<endl;
	}
	return 0;
}

结果只是和n/2比较