#include <bits/stdc++.h>
#include <random>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
//#define ll __int128
//#define int ll
//#define int ll
//#define char ll
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector< vi > vvi;
typedef vector< vvi > vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;

#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cerr << (#x) << " = " << (x) << endl;

#ifdef MAX_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif

const double PI = 2 * acos(0.0);
#define rand shittttty_shit
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());

const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";


template <class T0, class T1>
inline ostream & operator << (ostream &out, pair<T0, T1> &a) {
    return out << "{" << a.first << ", " << a.second << "}";
}

template <class T0, class T1>
inline istream & operator >> (istream &in, pair<T0, T1> &a) {
    return in >> a.first >> a.second;
}

template <class T0, class T1, class T2>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << "}";
}

template <class T0, class T1, class T2, class T3>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2, T3> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ", " <<  get<3>(a) << "}";
}

template<class T>
inline ostream & operator << (ostream &out, vector<T> &a) {
    out << "[";
    fori (i, a.size())
        out << a[i] << vector<string>{", ", "]  "}[i + 1 == a.size()];
    return out;
}


void smain();



signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
#ifdef MAX_HOME
    freopen("input.txt", "r", stdin);
    clock_t start = clock();
#endif
    cout << setprecision(12) << fixed;
    smain();
#ifdef MAX_HOME
    cout << "\n\n\n\nTOTAL EXECUTION TIME: " << float( clock () - start ) /  CLOCKS_PER_SEC << endl;
#endif
    return 0;
}

const int N = 1e5 + 10;

const int ZERO = 404;
const int SZ = ZERO * 2;
vi g[N];
vi rg[N];
int used[N];

int cnt_op;
int cnt_cl;
bool wrong;
vector<pii> edges;

void dfs_con(int v) {
    used[v] = true;
    if (g[v].size() < rg[v].size()) {
        cnt_op += rg[v].size() - g[v].size();
        if (v >= ZERO)
            wrong = true;
    } else if (g[v].size() > rg[v].size()) {
        cnt_cl += g[v].size() - rg[v].size();
        if (v < ZERO)
            wrong = true;
    }
    for (int to : g[v]) {
        if (!used[to]) {
            dfs_con(to);
            edges.push_back({v, to});
        }
    }
    for (int to : rg[v]) {
        if(!used[to]) {
            dfs_con(to);
            edges.push_back({to, v});
        }
    }
}

bool kek() {
    for (auto edge : edges) {
        if (edge.second >= ZERO && edge.first < ZERO) {
            return false;
        }
    }
    return true;
}

void smain() {

    int n, h;
    cin >> n >> h;
    fori (i, n) {
        int a, b, c, d;
        cin >> a >> b >> c >> d;
        int u;
        if (c > 0) {
            u = c;
        } else {
            u = ZERO + a;
        }
        int v;
        if (d > 0) {
            v = d + ZERO;
        } else {
            v = b;
        }
//        cerr << "(" << u << ", " << v << ")" << endl;
        g[u].push_back(v);
        rg[v].push_back(u);
    }

    for (int v = 0; v <= SZ; ++v) {
        if (used[v] || (g[v].size() + rg[v].size() == 0))
            continue;
        cnt_op = 0;
        cnt_cl = 0;
        wrong = false;
        edges.clear();
        dfs_con(v);
        if (cnt_cl != cnt_op || wrong || cnt_cl == 0) {
            cout << "NO\n";
            return;
        }
    }
    cout << "YES\n";
}

Measured memory_bytes: 6528