#include <iostream>
#include <vector>
#include <algorithm>
#include <memory>
#include <cassert>

using namespace std;

struct MaxFlow{
  typedef long long ll;
  const ll INF = 1e18;
  struct Edge{
    int u,v;
    ll c,rc;
    shared_ptr<ll> flow;
    Edge(int _u, int _v, ll _c, ll _rc = 0):u(_u),v(_v),c(_c),rc(_rc){
    }
  };
  struct FlowTracker{
    ll cap, rcap;
    shared_ptr<ll> flow;
    bool dir;
    FlowTracker(ll _cap, ll _rcap, shared_ptr<ll> _flow, int _dir):cap(_cap),rcap(_rcap),flow(_flow),dir(_dir){ }
    ll rem() const {
      if(dir == 0){
        return cap-*flow;
      }
      else{
        return rcap+*flow;
      }
    }
    void add_flow(ll f){
      if(dir == 0)
        *flow += f;
      else
        *flow -= f;
      assert(*flow <= cap);
      assert(-*flow <= rcap);
    }
    operator ll() const { return rem(); }
    void operator-=(ll x){ add_flow(x); }
    void operator+=(ll x){ add_flow(-x); }
  };
  int source,sink;
  vector<vector<int> > adj;
  vector<vector<FlowTracker> > cap;
  vector<Edge> edges;
  MaxFlow(int _source, int _sink):source(_source),sink(_sink){
    assert(source != sink);
  }
  int add_edge(int u, int v, ll c, ll rc = 0){
    edges.push_back(Edge(u,v,c,rc));
    return edges.size()-1;
  }
  vector<int> now,lvl;
  void prep(){
    int max_id = max(source, sink);
    for(auto edge : edges)
      max_id = max(max_id, max(edge.u, edge.v));
    adj.resize(max_id+1);
    cap.resize(max_id+1);
    now.resize(max_id+1);
    lvl.resize(max_id+1);
    for(auto &edge : edges){
      auto flow = make_shared<ll>(0);
      adj[edge.u].push_back(edge.v);
      cap[edge.u].push_back(FlowTracker(edge.c, edge.rc, flow, 0));
      if(edge.u != edge.v){
        adj[edge.v].push_back(edge.u);
        cap[edge.v].push_back(FlowTracker(edge.c, edge.rc, flow, 1));
      }
      assert(cap[edge.u].back() == edge.c);
      edge.flow = flow;
    }
  }
  bool dinic_bfs(){
    fill(now.begin(),now.end(),0);
    fill(lvl.begin(),lvl.end(),0);
    lvl[source] = 1;
    vector<int> bfs(1,source);
    for(int i = 0; i < (int) bfs.size(); ++i){
      int u = bfs[i];
      for(int j = 0; j < (int) adj[u].size(); ++j){
        int v = adj[u][j];
        if(cap[u][j] > 0 && lvl[v] == 0){
          lvl[v] = lvl[u]+1;
          bfs.push_back(v);
        }
      }
    }
    return lvl[sink] > 0;
  }
  ll dinic_dfs(int u, ll flow){
    if(u == sink)
      return flow;
    while(now[u] < (int) adj[u].size()){
      int v = adj[u][now[u]];
      if(lvl[v] == lvl[u] + 1 && cap[u][now[u]] != 0){
        ll res = dinic_dfs(v,min(flow,(ll)cap[u][now[u]]));
        if(res > 0){
          cap[u][now[u]] -= res;
          return res;
        }
      }
      ++now[u];
    }
    return 0;
  }
  ll calc_max_flow(){
    prep();
    ll ans = 0;
    while(dinic_bfs()){
      ll cur = 0;
      do{
        cur = dinic_dfs(source,INF);
        ans += cur;
      }while(cur > 0);
    }
    return ans;
  }
  ll flow_on_edge(int edge_index){
    assert(edge_index < (int) edges.size());
    return *edges[edge_index].flow;
  }
};

// auto mf = MaxFlow(1,n);
// arguments source and sink, memory usage
// O(largest node index + input size), sink
// doesn't need to be last index
// int edge_index;
// for(int i = 0; i < m; ++i){
//    int a,b,c;
//    cin >> a >> b >> c;
//mf.add\_edge(a,b,c); // for directed edges
//      edge_index = mf.add_edge(a,b,c,c); // store edge index if care about flow value
//   }
//  cout << mf.calc_max_flow() << '\n';
//cout << mf.flow\_on\_edge(edge\_index) << endl; // return flow on this edge
//}


const int MAX_V = 420;
const int INV = 0;
const int TERMV = 205;
const int SOURCE = 421;
const int SINK = 422;

int out [MAX_V];
int in [MAX_V];

void failure () {
  cout << "NO" << endl;
  exit(0);
}

vector<int> adj [MAX_V];
void add_edge (int u, int v) {
  adj[u].push_back(v);
}

int vis [MAX_V];
void dfs (int u) {
  vis[u] = 1;
  for (int nxt : adj[u]) {
    if (!vis[nxt]) {
      dfs(nxt);
    }
  }
}

int main () {
  ios::sync_with_stdio(false);
  
  int n, h;
  cin >> n >> h;

  auto mf = MaxFlow(SOURCE, SINK);
  vector<pair<pair<int, int>, int>> edges; // <<u, v>, idx>
  for (int i = 0; i < n; i++) {
    int a, b, c, d;
    cin >> a >> b >> c >> d;

    int u;
    if (c == 0) {
      // left endpoint is an initial node
      u = INV + a;
    } else {
      // left endpoint is a terminal node
      u = TERMV + c;
    }

    int v;
    if (d == 0) {
      // right endpoint is a terminal node
      v = TERMV + b;
    } else {
      // right endpoint is an initial node
      v = INV + d;
    }

    out[u]++;
    in[v]++;

    int idx = mf.add_edge(u, v, 1);
    edges.push_back(make_pair(make_pair(u, v), idx));
  }

  int expf = 0;
  for (int i = 1; i <= h; i++) {
    if (in[INV + i] > out[INV + i]) {
      failure();
    }

    expf += out[INV + i] - in[INV + i];
    mf.add_edge(SOURCE, INV + i, out[INV + i] - in[INV + i]);
  }

  for (int i = 1; i <= h; i++) {
    if (out[TERMV + i] > in[TERMV + i]) {
      failure();
    }

    expf += in[TERMV + i] - out[TERMV + i];
    mf.add_edge(TERMV + i, SINK, in[TERMV + i] - out[TERMV + i]);
  }

  int flow = mf.calc_max_flow();
  expf /= 2;

  if (flow != expf) failure();

  // now we have a bunch of Eulerian cycles left
  vector<int> tovis;
  for (auto e : edges) {
    if (mf.flow_on_edge(e.second) == 0) {
      add_edge(e.first.first, e.first.second);
    } else {
      tovis.push_back(e.first.first);
      tovis.push_back(e.first.second);
    }
  }

  for (int u : tovis) {
    if (!vis[u]) {
      dfs(u);
    }
  }

  for (int i = 1; i <= h; i++) {
    if (in[INV + i] != 0) {
      if (!vis[INV + i]) {
        failure();
      }
    }

    if (in[TERMV + i] != 0) {
      if (!vis[TERMV + i]) {
        failure();
      }
    }
  }

  cout << "YES" << endl;
}


Measured memory_bytes: 24476