#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()
#define fo(i, n) rep(i, 0, n)
#define F first
#define S second
#define MP make_pair
#define PB push_back
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
typedef vector<pair<ll, ll>> vpll;
typedef vector<vector<ll>> vvll;


signed main() {
    cin.tie(0)->sync_with_stdio(0);
    int n, p;
    cin >> n >> p;
    vpii v(n);
    vi pow(n,0);
    fo(i, n) {
    	cin >> v[i].F >> v[i].S;
    }
    fo(i, n) {
	    for(int j=i+1; j<n; j++) {
		    if (
		        (v[i].F == v[j].F) ||
		        (v[i].S == v[j].S)
		    )
			    pow[i] = pow[j] = 1;
	    }
    }
    int sum=0;
    fo(i, n) sum += pow[i];
    if (100*sum/n >= p)
	    cout << "YES" << endl;
    else
	    cout << "NO" << endl;
}