Codeforces Beta Round #17 A.素数相关

A. Noldbach problem

Nick is interested in prime numbers. Once he read about Goldbach problem. It states that every even integer greater than 2 can be expressed as the sum of two primes. That got Nick's attention and he decided to invent a problem of his own and call it Noldbach problem. Since Nick is interested only in prime numbers, Noldbach problem states that at least k prime numbers from 2 to n inclusively can be expressed as the sum of three integer numbers: two neighboring prime numbers and 1. For example, 19 = 7 + 11 + 1, or 13 = 5+ 7 + 1.

Two prime numbers are called neighboring if there are no other prime numbers between them.

You are to help Nick, and find out if he is right or wrong.

Input

The first line of the input contains two integers n (2 ≤ n ≤ 1000) and k (0 ≤ k ≤ 1000).

Output

Output YES if at least k prime numbers from 2 to n inclusively can be expressed as it was described above. Otherwise output NO.

Examples

input

27 2

output

YES

input

45 7

output

NO

Note

In the first sample the answer is YES since at least two numbers can be expressed as it was described (for example, 13 and 19). In the second sample the answer is NO since it is impossible to express 7 prime numbers from 2 to 45 in the desired form.

题意：问2到n间有多少个素数为两个相邻素数相加加一；

思路：暴力就好了

#include<iostream>
#include<cstdio>
#include<cmath>
#include<string>
#include<queue>
#include<algorithm>
#include<stack>
#include<cstring>
#include<vector>
#include<list>
#include<set>
#include<map>
#define true ture
#define false flase
using namespace std;
#define ll __int64
#define inf 0xfffffff
int scan()
{
    int res =  , ch ;
    while( !( ( ch = getchar() ) >= '' && ch <= '' ) )
    {
        if( ch == EOF )  return  <<  ;
    }
    res = ch - '' ;
    while( ( ch = getchar() ) >= '' && ch <= '' )
        res = res *  + ( ch - '' ) ;
    return res ;
}
int p[],flag[];
int prime(int n)
{
    if(n<=)
    return ;
    if(n==)
    return ;
    if(n%==)
    return ;
    int k, upperBound=n/;
    for(k=; k<=upperBound; k+=)
    {
        upperBound=n/k;
        if(n%k==)
            return ;
    }
    return ;
}
int main()
{
    int ji=;
    for(int i=;i<=;i++)
    {
        if(prime(i))
        p[ji++]=i;
    }
    for(int i=;i<ji;i++)
    {
        int gg=p[i]+p[i-]+;
        if(prime(gg))
        flag[gg]=;
    }
    int x,y;
    int ans=;
    scanf("%d%d",&x,&y);
    for(int i=;i<=x;i++)
    if(flag[i])
    ans++;
    if(ans>=y)
        cout<<"YES"<<endl;
    else
        cout<<"NO"<<endl;
    return ;
}