#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#include <cmath>
#include <stack>
#include <algorithm>

using namespace std;

stack<int> s;
bool vis[20100];
int low[20100];
int degree[20100];
int lastshow[20100];
int dfn[20100];
int cnt;
int n, m;
int Bcnt;
int id;
int index;
bool instack[20100];
int level[20100];

void init(){
    for(int i = 0;i <= 2*n+2; i ++){
        low[i] = 0;
        lastshow[i] = -1;
        dfn[i] = 0;
        level[i] = 0;
        instack[i] = false;
    }
    cnt = 0;
    index = 1;
    Bcnt = 0;
    while(!s.empty())
        s.pop();
}

struct edge{
    int to;
    int next;
}e[2000010];

void insert(int a, int b){
    e[cnt].to = b;
    e[cnt].next = lastshow[a];
    lastshow[a] = cnt++;
}

void dfs(int i){
    int j;
    low[i] = dfn[i] = index++;
    instack[i] = true;
    s.push(i);
    id = lastshow[i];
   // printf("x %d", id);
    while(id != -1){
        //printf("x %d", id);
        j = e[id].to;
        if(!dfn[j]){
           // printf("#%d#", dfn[j]);
            dfs(j);
            low[i] = min(low[i], low[j]);
        }
        else if(instack[j])
            low[i] = min(low[i], dfn[j]);
        id = e[id].next;
        //printf("d");
    }
    if(dfn[i] == low[i]){
        Bcnt ++;
        do{
            j = s.top();
            s.pop();
            level[j] = Bcnt;
            instack[j] = false;
        }
        while(j != i);
    }
}

bool solve(){
    bool flag = true;
    for(int i = 0; i <= n-1; i ++){
        if(level[2*i] == level[2*i+1]){
            flag = false;
            break;
        }
    }
    return flag;
}

int main(){
    int i, a1, a2, c1, c2;
    while(~scanf("%d %d", &n ,&m)){
        init();
        for(i = 1; i <= m; i ++){
            scanf("%d %d %d %d", &a1, &a2, &c1, &c2);
            insert(2 * a1 + c1, 2 * a2 + 1 - c2);
            insert(2 * a2 + c2, 2 * a1 + 1 - c1);
        }
        for(i = 0; i < 2*n; i ++){
            if(0 == dfn[i])
            dfs(i);
        }
//        for(i = 0; i < n; i ++){
//            printf("%d %d %d\n",dfn[i], low[i], level[i]);
//        }
        if(solve())
            printf("YES\n");
        else
            printf("NO\n");
    }
    return 0;
}