// Copyright (C) 2017 __debug.

// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; version 3

// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License
// along with this program; If not, see <http://www.gnu.org/licenses/>.


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>

#define x first
#define y second
#define MP std::make_pair
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define DEBUG(...) fprintf(stderr, __VA_ARGS__)
#ifdef __linux__
#define getchar getchar_unlocked
#define putchar putchar_unlocked
#endif

using std::pair;
using std::vector;
using std::string;

typedef long long LL;
typedef pair<int, int> Pii;

const int oo = 0x3f3f3f3f;

template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, true : false; }
template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, true : false; }
string procStatus()
{
    std::ifstream t("/proc/self/status");
    return string(std::istreambuf_iterator<char>(t), std::istreambuf_iterator<char>());
}
template<typename T> T read(T &x)
{
    int f = 1;
    char ch = getchar();
    for (; !isdigit(ch); ch = getchar())
        f = (ch == '-' ? -1 : 1);
    for (x = 0; isdigit(ch); ch = getchar())
        x = 10 * x + ch - '0';
    return x *= f;
}
template<typename T> void write(T x)
{
    if (x == 0) {
        putchar('0');
        return;
    }
    if (x < 0) {
        putchar('-');
        x = -x;
    }
    static char s[20];
    int top = 0;
    for (; x; x /= 10)
        s[++top] = x % 10 + '0';
    while (top)
        putchar(s[top--]);
}
// EOT

const int MAXN = 1e5 + 5, MAXH = 205;
const int MAXV = MAXH * 2 + 5, MAXE = MAXN;

int N, H;
int A[MAXN], B[MAXN], C[MAXN], D[MAXN];

void input()
{
    read(N); read(H);
    for (int i = 1; i <= N; ++i) {
        read(A[i]); read(B[i]); read(C[i]); read(D[i]);
    }
}

vector<int> G[MAXV];
int indeg[MAXN], oudeg[MAXN];
bool vis[MAXN];
int cnt;

void dfs(int u)
{
    vis[u] = true;
    cnt += (indeg[u] != oudeg[u]);
    for (int i = 0; i < SZ(G[u]); ++i) {
        int v = G[u][i];
        if (!vis[v])
            dfs(v);
    }
}

void solve()
{
    for (int i = 1; i <= N; ++i) {
        int u = C[i] ? C[i] : A[i] + H;
        int v = D[i] ? D[i] + H : B[i];
        G[u].push_back(v);
        G[v].push_back(u);
        ++indeg[v];
        ++oudeg[u];
    }

    int s = 0, t = 0;
    for (int i = 1; i <= H; ++i) {
        if (indeg[i] < oudeg[i])
            goto FAIL;
    }
    for (int i = H + 1; i <= H * 2; ++i) {
        if (indeg[i] > oudeg[i])
            goto FAIL;
    }

    for (int i = 1; i <= H * 2; ++i) {
        if (vis[i] || SZ(G[i]) == 0)
            continue;
        cnt = 0;
        dfs(i);
        if (!cnt)
            goto FAIL;
    }

    puts("YES");
    return;
  FAIL:
    puts("NO");
}

int main()
{
#ifdef __DEBUG
    freopen("E.in", "r", stdin);
    freopen("E.out", "w", stdout);
#endif

    input();
    solve();

    return 0;
}

// 细雨春芜上林苑，颓垣夜月洛阳宫。
//     -- 陆游《书愤五首·其二》


Measured memory_bytes: 3328