#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
// #define endl '\n'
#define F first
#define S second
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sz(x) (int)(x).size()

struct Coord {
    int x, y;
};

void tc() {
    int n, p; cin >> n >> p;
    vector<Coord> a(n); for (auto & [x, y] : a) cin >> x >> y;
    map<tuple<int, int, int>, int> freq;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < i; j++) {
            auto [x1, y1] = a[i];
            auto [x2, y2] = a[j];
            int A = 2*(x1-x2), B = 2*(y1-y2);
            vector<pair<int, int>> xd = {{A, B}, {-A, -B}};
            sort(all(xd));
            int a = xd[0].F;
            int b = xd[0].S;
            int sx = x1+x2;
            int sy = y1+y2;
            int c = a*sx + b*sy;
            int G = __gcd(abs(a), __gcd(abs(b), abs(c)));
            a /= G;
            b /= G;
            c /= G;
            freq[{a, b, c}]++;
        }
    }
    int mx = 0;
    for (auto const& [_, f] : freq) mx = max(mx, f);
    mx *= 2;
    if (mx * 100 >= n * 80) cout << "YES" << endl;
    else cout << "NO" << endl;
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    tc();
}