#include<bits/stdc++.h>

using namespace std;

int N, H, balance[409];
vector < int > v[409];

void answer (bool value)
{
    if (value) printf ("YES\n");
    else printf ("NO\n");
    exit (0);
}

bool anyNonZero, anyEdge, ap[409], anyLoop[409];
void dfs (int nod)
{
    ap[nod] = 1, anyNonZero |= (balance[nod] != 0);
    anyEdge |= anyLoop[nod];
    for (auto it : v[nod])
        if (ap[it] == 0)
            dfs (it), anyEdge = 1;
}

int main ()
{
//freopen ("input", "r", stdin);
//freopen ("output", "w", stdout);

scanf ("%d %d", &N, &H);
for (int i=1; i<=N; i++)
{
    int a, b, c, d, x, y;
    scanf ("%d %d %d %d", &a, &b, &c, &d);
    x = (c == 0 ? H + a + 1 : c);
    y = (d != 0 ? H + d + 1 : b);
    v[x].push_back (y);
    v[y].push_back (x);
//    printf ("%d -> %d\n", x, y);
    balance[x] ++, balance[y] --;
    if (x == y) anyLoop[x] = 1;
}
for (int i=1; i<=2 * H; i++)
    if ((balance[i] > 0 && i <= H) ||
        (balance[i] < 0 && i > H))
            answer (0);
for (int i=1; i<=2 * H; i++)
    if (ap[i] == 0)
    {
        anyNonZero = 0;
        anyEdge = 0;
        dfs (i);
        if (!anyNonZero && anyEdge)
            answer (0);
    }
answer (1);
return 0;
}
