#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <utility>
using namespace std;

namespace {
  using Integer = long long; //__int128;
  template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;}
  template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
  template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
  template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;}
  template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
  template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}

  template<class H> void print(const H& head){ cout << head; }
  template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
  template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }

  template<class H> void eprint(const H& head){ cerr << head; }
  template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
  template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }

  class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator   end(){ return range_iterator(  end_, step_); } };

  inline string operator "" _s (const char* str, size_t size){ return move(string(str)); }
  constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
  constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
  constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }

  inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed

  mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());

  template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str(); }

  inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }
}
constexpr long long mod = 9_ten + 7;

typedef struct{
  int to;
  int cap;
  int rev;
  bool is_rev;
}edge;

// node v : distance from s => level[v]
void bfs(vector<vector<edge> > &G, vector<int> &level, int s){
  fill(level.begin(), level.end(), -1);
  queue<int> q;
  q.push(s);
  level[s] = 0;
  while(!q.empty()){
    int e=q.front(); q.pop();
    for(int i=0; i<G[e].size(); i++){
      if(G[e][i].cap > 0 && level[G[e][i].to] < 0){
        level[G[e][i].to] = level[e] + 1;
        q.push(G[e][i].to);
      }
    }
  }
}

int dfs(vector<vector<edge> > &G, vector<int> &level, vector<bool> &used, vector<int> &iter, int s, int f,  int t){
  if(s==t) return f;
  else{
    //iter[e] : done searching from v[0] to v[ iter[e]-1 ]
    for(int &i=iter[s]; i<G[s].size(); i++){
      //distance from s to v[e][i].to must be longer than dist from s to v
      if(G[s][i].cap > 0 && level[s] < level[ G[s][i].to ]){
        int d = dfs(G, level, used, iter, G[s][i].to, min(f, G[s][i].cap), t);
        if(d>0){
          G[s][i].cap -= d;
          G[ G[s][i].to ][ G[s][i].rev ].cap += d;
          return d;
        }
      }
    }
    return 0;
  }
}

int dinic_maxflow(vector<vector<edge> > &G, int s, int t){
  const int INF = 100000000;
  int flow=0;
  while(true){
    vector<int> level(G.size(), -1);
    vector<int> iter(G.size(), 0);
    vector<bool> used(G.size(), false);
    bfs(G, level, s);
    if(level[t] < 0) return flow; //unable to achieve to t
    while(true){
      int f = dfs(G, level, used, iter, s, INF, t);
      if(f==0) break;
      else flow += f;
    }
  }
}

void add_edge(vector<vector<edge> > &G, int from, int to, int cap){
  G[from].push_back((edge){to, cap, (int)G[to].size(), false});
  G[to].push_back((edge){from, 0, (int)G[from].size() - 1, true});
}

class SCC{
  int n;
  vector<vector<int> > G;
  vector<vector<int> > rG;
  
  void dfs(vector<bool> &visit, int pos, vector<int> &result){
    visit[pos] = true;
    for(int i=0; i<G[pos].size(); i++){
      if(visit[ G[pos][i] ]) continue;
      dfs(visit, G[pos][i], result);
    }
    result.push_back(pos);
  }

  void rdfs(vector<bool> &visit, int pos, int k){
    visit[pos] = true;
    component[pos] = k;
    for(int i=0; i<rG[pos].size(); i++){
      if(visit[ rG[pos][i] ]) continue;
      rdfs(visit, rG[pos][i], k);
    }
  }

  void make_rev(vector<vector<int> > &G){
    for(int i=0; i<n; i++){
      for(int j=0; j<G[i].size(); j++){
        rG[ G[i][j] ].push_back(i);
      }
    }
  }

 public:
  int num_components;
  vector<int> component;
  vector< vector<int> > scc_graph;
  
  SCC(int n){
    this->n = n;
    G.resize(n);
    rG.resize(n);
  }

  SCC(vector<vector<int> > &G){
    this->n = G.size();
    this->G = G;
    rG.resize(n);
    make_rev(G);
  }
  
  void strongly_connected_components(){
    vector<bool> visit(n, false);
    vector<int> result;

    for(int i=0; i<n; i++){
      if(visit[i]) continue;
      dfs(visit, i, result);
    }

    
    component.resize(n);
    fill(visit.begin(), visit.end(), false);
    int k=0;
    for(int i=result.size()-1; i>=0; i--){
      if(visit[ result[i] ]) continue;
      rdfs(visit, result[i], k);
      k++;
    }

    num_components = k;
    scc_graph.resize( num_components );
    for(int i=0; i<n; i++){
      int cmp = component[i];
      for(int j=0; j<G[i].size(); j++){
        if(component[ G[i][j] ] == cmp) continue;
        scc_graph[cmp].push_back( component[ G[i][j] ] );
      }
    }
    
    for(int i=0; i<scc_graph.size(); i++){
      sort(scc_graph[i].begin(), scc_graph[i].end());
      scc_graph[i].erase( unique(scc_graph[i].begin(), scc_graph[i].end()), scc_graph[i].end());
    }
    
  }
  
  void add_edge(int from, int to){
    G[from].push_back(to);
    rG[to].push_back(from);
  }
};


int main(){
  int n,h;
  cin >> n,h;
  vector<int> a(n),b(n),c(n),d(n);
  for(int i=0; i<n; i++){
    cin >> a[i],b[i],c[i],d[i];
  }

  map<pair<int,int>, int> in_cnt;
  map<pair<int,int>, int> out_cnt;
  int z_in = 0, z_out = 0;
  for(int i=0; i<n; i++){
    if( c[i] == 0 ){
      in_cnt[ {a[i], 0} ]++;
      z_in++;
    }else{
      in_cnt[ {c[i], 1} ]++;
    }
    if( d[i] == 0 ){
      out_cnt[ {b[i], 0} ]++;
      z_out++;
    }else{
      out_cnt[ {d[i], 1} ]++;
    }
  }

  map<tuple<int,int,int>, int> dict;
  int idx = 0;
  for(auto p : in_cnt){
    auto t = make_tuple(0, p.first.first, p.first.second);
    dict[t] = idx;
    idx++;
  }
  for(auto p : out_cnt){
    auto t = make_tuple(1, p.first.first, p.first.second);
    dict[t] = idx;
    idx++;
  }


  int zero_0 = idx++;
  int zero_1 = idx++;
  int source = idx++;
  int sink = idx++;

  int super_source = idx++;
  int super_sink = idx++;

  vector<vector<edge>> G(idx);
  SCC scc(idx-4);


  scc.add_edge(zero_0, zero_1);
  add_edge(G, zero_0, zero_1, n+10);
  add_edge(G, super_source, zero_1, 1);
  add_edge(G, zero_0, super_sink, 1);

  for(int i=0; i<n; i++){
    auto t = make_tuple(0, c[i]==0 ? a[i] : c[i], min(1, c[i]));
    auto r = make_tuple(1, d[i]==0 ? b[i] : d[i], min(1, d[i]));
    scc.add_edge( dict[t], dict[r] );
  }

  for(auto p : in_cnt){
    auto t = make_tuple(0, p.first.first, p.first.second);
    int v = dict[t];
    add_edge(G, v, sink, p.second);

    if( p.first.second == 0 ){
      add_edge(G, zero_1, v, p.second);
      scc.add_edge(zero_1, v);
    }
  }
  for(auto p : out_cnt){
    auto t = make_tuple(1, p.first.first, p.first.second);
    int v = dict[t];
    add_edge(G, source, v, p.second);
    auto r = make_tuple(0, p.first.first, p.first.second^1);
    if( dict.count(r) ){
      add_edge(G, v, dict[r], p.second);
      scc.add_edge(v, dict[r]);
    }

    if( p.first.second == 0 ){
      add_edge(G, v, zero_0, p.second);
      scc.add_edge(v, zero_0);
    }
  }

  scc.strongly_connected_components();
  int cmp = scc.num_components;
  eprintln(cmp);
  if(cmp != 1){
    println("NO");
    return 0;
  }

  int f = 0;
  // f += dinic_maxflow(G, super_source, sink);
  // f += dinic_maxflow(G, source, super_sink);
  // f += dinic_maxflow(G, super_source, super_sink);
  eprintln(f);

  // if( f != 2 ){
  //   println("NO");
  //   return 0;
  // }
  // f--;
  if(!z_in || !z_out){
    println("NO");
    return 0;
  }

  add_edge(G, super_source, source, n+100);
  add_edge(G, sink, super_sink, n+100);

  f += dinic_maxflow(G, super_source, super_sink) - 1;
  // f += dinic_maxflow(G, source, sink);
  eprintln(f);

  if( f!=n ){
    println("NO");
    return 0;
  }

  SCC scc2(G.size()-4);
  scc2.add_edge(zero_0, zero_1);
  for(int i=0; i<G.size()-4; i++){
    for(auto e : G[i]){
      if( e.is_rev || e.to >= G.size()-4 || G[e.to][e.rev].cap == 0 ) continue;
      scc2.add_edge(i, e.to);
    }
  }

  for(int i=0; i<n; i++){
    auto t = make_tuple(0, c[i]==0 ? a[i] : c[i], min(1, c[i]));
    auto r = make_tuple(1, d[i]==0 ? b[i] : d[i], min(1, d[i]));
    scc2.add_edge( dict[t], dict[r] );
  }

  scc2.strongly_connected_components();

  int cmp2 = scc2.num_components;
  if( cmp2 != 1 ){
    println("NO");
  }else{
    println("YES");
  }

  return 0;
}


Measured memory_bytes: 4864