#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <numeric>

template <class T, class U>
inline bool chmin(T &lhs, const U &rhs) {
  if (lhs > rhs) {
    lhs = rhs;
    return true;
  }
  return false;
}

template <class T, class U>
inline bool chmax(T &lhs, const U &rhs) {
  if (lhs < rhs) {
    lhs = rhs;
    return true;
  }
  return false;
}

// [l, r) from l to r
struct range {
  struct itr {
    int i;
    constexpr itr(int i_): i(i_) { }
    constexpr void operator ++ () { ++i; }
    constexpr int operator * () const { return i; }
    constexpr bool operator != (itr x) const { return i != x.i; }
  };
  const itr l, r;
  constexpr range(int l_, int r_): l(l_), r(std::max(l_, r_)) { }
  constexpr itr begin() const { return l; }
  constexpr itr end() const { return r; }
};

// [l, r) from r to l
struct revrange {
  struct itr {
    int i;
    constexpr itr(int i_): i(i_) { }
    constexpr void operator ++ () { --i; }
    constexpr int operator * () const { return i; }
    constexpr bool operator != (itr x) const { return i != x.i; }
  };
  const itr l, r;
  constexpr revrange(int l_, int r_): l(l_ - 1), r(std::max(l_, r_) - 1) { }
  constexpr itr begin() const { return r; }
  constexpr itr end() const { return l; }
};

class union_find {
private:
  int component;
  std::vector<int> parent;

public:
  union_find() = default;
  union_find(int size_) { init(size_); }

  void init(int size_) {
    component = size_;
    parent.assign(size_, -1);
  }

  int count_components() const { 
    return component; 
  }
  int component_size(int i) { 
    return -parent[find_parent(i)]; 
  }
  bool same_component(int i, int j) { 
    return find_parent(i) == find_parent(j); 
  }

  int find_parent(int i) {
    if (parent[i] < 0) {
      return i;
    }
    else {
      return parent[i] = find_parent(parent[i]);
    }
  }

  bool unite(int i, int j) {
    i = find_parent(i);
    j = find_parent(j);
    if (i == j) {
      return false;
    }
    if (parent[i] > parent[j]) {
      std::swap(i, j);
    }
    parent[i] += parent[j];
    parent[j] = i;
    --component;
    return true;
  }

};

int main() {
  int N, H;
  std::cin >> N >> H;
  std::vector<int> A(N), B(N), C(N), D(N);
  for (int i: range(0, N)) {
    std::cin >> A[i] >> B[i] >> C[i] >> D[i];
    --A[i]; --B[i]; --C[i]; --D[i];
  }
  std::vector<int> in(2 * H), out(2 * H);
  union_find dsu(2 * H);
  for (int i: range(0, N)) {
    int l, r;
    if (C[i] == -1) l = A[i];
    else l = H + C[i];
    if (D[i] == -1) r = H + B[i];
    else r = D[i];
    ++out[l];
    ++in[r];
    dsu.unite(l, r);
  }
  for (int i: range(0, H)) {
    if (in[i] > out[i]) {
      std::cout << "NO\n";
      return 0;
    }
    if (in[H + i] < out[H + i]) {
      std::cout << "NO\n";
      return 0;
    }
  }
  std::vector<int> ok(2 * H, 0);
  for (int i: range(0, 2 * H)) {
    int p = dsu.find_parent(i);
    if (i != p) {
      ok[i] = 2;
    }
    if (in[i] == 0 && out[i] == 0) {
      ok[p] = 1;
    }
    else if (in[i] != out[i]) {
      ok[p] = 1;
    }
  }
  for (int i: range(0, 2 * H)) {
    if (!ok[i]) {
      std::cout << "NO\n";
      return 0;
    }
  }
  std::cout << "YES\n";
  return 0;
}


Measured memory_bytes: 1792