#include <bits/stdc++.h>

#define int long long
#define endl '\n'
#define x first
#define y second
#define double long double
#define all(x) x.begin(), x.end()
#define sz(x) (int)((x).size())
constexpr int pla=1e9+7;
using namespace std;
pair<double,double> get_perp(pair<int,int>a,pair<int,int>b){
    int x1=a.x,x2=b.x,y1=a.y,y2=b.y;
    if(y1==y2){
        return {pla,(x1+x2)/2.0};
    }
    if(x1==x2){
        return {0,(y1+y2)/2.0};
    }
    double k=((y2-y1)*1.0)/(x2-x1);
    double k1=((x2-x1)*1.0)/(y1-y2);
    // assert(k*k1==-1.0);

    double b1=(y1*y1-y2*y2+x1*x1-x2*x2)/(2.0*(y1-y2));
    return {k1,b1};
}
void solve([[maybe_unused]] int test_case){
    int n,p;
    cin>>n>>p;
    pair<int,int>a[n+1];
    for(int i=1;i<=n;i++){
        cin>>a[i].x>>a[i].y;
    }
    map<pair<double,double>,int>mp;
    for(int i=1;i<=n;i++){
        for(int j=i+1;j<=n;j++){
            pair<double,double>perp=get_perp(a[i],a[j]);
            mp[perp]++;
        }
    }
    for(auto &[i,j]:mp){
        //cout<<i.x<<' '<<i.y<<endl;
        if(n*p<=j*200){
            cout<<"YES"<<endl;
            return;
        }
    }
    cout<<"NO"<<endl;
}

int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int test = 1;
    // cin>>test;
    for(int _=1;_<=test;_++){
        solve(_);
    }

    return 0;
}