#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef pair<ld, ld> pdd;
#define vec vector
#define For(i, a, n) for(ll i=(ll)a;i<n;i++)
#define all(x) begin(x), end(x)
#define sz(x) (ll)size(x)

template<class A, class B>
pair<A,B>operator+(const pair<A, B>&a, const pair<A,B>&b){
    return {a.first + b.first, a.second + b.second};
}
template<class A, class B>
pair<A,B>operator-(const pair<A, B>&a, const pair<A,B>&b){
    return {a.first - b.first, a.second - b.second};
}
template<class A, class B>
ostream&operator<<(ostream&os, const pair<A, B>&c){
    return os<<"("<<c.first<<", "<<c.second<<")";
}
template<class A, class B, class C>
basic_ostream<A,B>&operator<<(basic_ostream<A, B>&os, const C&c){
    for(auto itr=begin(c);itr!=end(c);++itr){
        os<<(itr==begin(c)?"":" ")<<*itr;
    }
    return os;
}
template<typename...Args>
void dbg(Args&&...args){
    ((cerr<<args<<" |"),...);cerr<<endl;
}
#define mod 1000000007

ll mpow(ll n, ll k){
    if(k == 0)return 1;
    ll x = mpow(n, k/2);
    ll x2 = (x*x)%mod;
    if(k%2)return (x2 * n)%mod;
    return x2;
}
unordered_map<ll, ll> memo;
ll inverz(ll n){
    if(memo.count(n)) return memo[n];
    else{
        memo[n] = mpow(n, mod-2);
        return memo[n];
    }
}

void solve(){
    ll n, p;cin>>n>>p;
    vec<pll> points(n); for(auto&i:points)cin>>i.first>>i.second;
    map<pair<pll, pll>, ll> ciary;
    map<ll, ll> vodorovne, zvysle;
    For(i, 0, n){
        For(j, i+1, n){
            pll mid = points[i] + points[j];
            pll s = points[i] - points[j];
            pll v = {s.second, - s.first};
            if(v.first == 0) {
                dbg(i, j, mid.first);
                vodorovne[mid.first]++;
                continue;
            }
            if(v.second == 0){
                zvysle[mid.second] ++;
                continue;
            }
            pll a = {v.first, v.second};
            pll b = {mid.second*v.first - mid.first *v.second , v.first};
            ll ga = gcd(abs(a.first), abs(a.second)), gb = gcd(abs(b.first), abs(b.second));
            a = {a.first/ga, a.second/ga}, b = {b.first/gb, b.second/gb};
            ciary[{a, b}]+= 1;
        }
    }

    // dbg(ciary);
    // dbg(vodorovne, zvysle);
    for(auto [_, pocet] : ciary){
        if(pocet*2*100>=p*n){
            cout<<"YES\n";return;
        }
    }
    for(auto [_, pocet] : vodorovne){
        if(pocet*2*100>=p*n){
            cout<<"YES\n";return;
        }
    }
    for(auto [_, pocet] : zvysle){
        if(pocet*2*100>=p*n){
            cout<<"YES\n";return;
        }
    }
    cout<<"NO"<<endl;
}

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

    int t = 1;
    while(t--)solve();
    return 0;
}