#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(int i=a;i<(b);++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;

typedef complex<long double> point;

int main(){
    cin.tie(0)->sync_with_stdio(0);
    cout.tie(0);
    

    int n;cin>>n;
    int p;cin>>p;
    vector<point> arr(n);
    rep(i,0,n){
        int x,y;
        cin>>x>>y;
        arr[i] = point(x,y);
    }
    // vector<pair<point, double>> lines;
    map<pair<pair<ll, ll>, ll>, int> lines;


    for (int i=0;i<n;i++){
        for (int j=i+1;j<n;j++){
            point A = arr[i];
            point B = arr[j];
            point A2B = A-B;
            point mid = A2B*(long double)0.5+B;
            A2B = A2B/abs(A2B);
            if (A2B.real()<0){
                A2B*=-1;
            }
            ll c = round(-(mid.real()*A2B.real() + mid.imag()*A2B.imag())*1e9);
            ll a = round(A2B.real()*1e9);
            ll b = round(A2B.imag()*1e9);


            if (lines.count({{a,b},c})==0){
                lines[{{a,b},c}] = 0;
            }
            lines[{{a,b},c}]++;
        }
    }

    int ma=0;
    for (auto [somth, count_]:lines){
        ma=max(count_,ma);
    }

    if ((double)2*ma/n*100.0+1e-13 >= p){
        cout<<"YES\n";
    } else {
        cout<<"NO\n";
    }


}