#include <bits/stdc++.h>
using namespace std;
int lol[100001];
bool dp[5002][5002][3];
bool vis[5002][5002][3];
vector<array<int,2>> adj[5002];
int n;
bool solve(int i,int la,int dd){
    if(i==n+1){
        return 1;
    }
    if(vis[i][la][dd])return dp[i][la][dd];
    bool c1 = 0;
    vis[i][la][dd] = 1;
    if(lol[i]==-1){
        for(int e = 0;e<2;e++){
            int la0 = 0, la1 =0;
            if(e==dd){
                if(dd==0)la0 = i , la1 = la;
                else la1 = i , la0 = la;
            }else{
                if(e)la1 = i , la0 = i-1;
                else la0 = i , la1 = i-1;
            }
            //cout<<la0<<" "<<la1<<" "<<i<<" "<<e<<endl;
            bool ss = 1;
            for(auto q:adj[i]){
                if(q[1]==0){
                    if(la0<q[0]){
                        ss = 0;
                    }
                }else{
                    if(la1<q[0]){
                        ss = 0;
                    }
                }
            }
            if(ss){
                if(la0==i){
                    c1 = max(c1,solve(i+1,la1,0));
                }else{
                    c1 = max(c1,solve(i+1,la0,1));
                }
            }
        }
    }else{
        for(int e = lol[i];e<=lol[i];e++){
            int la0 =0, la1 = 0;
            if(e==dd){
                if(dd==0)la0 = i , la1 = la;
                else la1 = i , la0 = la;
            }else{
                if(e)la1 = i , la0 = i-1;
                else la0 = i , la1 = i-1;
            }
            //cout<<la0<<" "<<la1<<" "<<i<<" "<<e<<endl;
            bool ss = 1;
            for(auto q:adj[i]){
                if(q[1]==0){
                    if(la0<q[0]){
                        ss = 0;
                    }
                }else{
                    if(la1<q[0]){
                        ss = 0;
                    }
                }
            }
            if(ss){
                if(la0==i){
                    c1 = max(c1,solve(i+1,la1,0));
                }else{
                    c1 = max(c1,solve(i+1,la0,1));
                }
            }
        }
    }
    return dp[i][la][dd] = c1;
}void print(int i,int la,int dd){
    if(i==n+1){
        return ;
    }
    if(lol[i]==-1){
        for(int e = 0;e<2;e++){
            int la0 = 0, la1 =0;
            if(e==dd){
                if(dd==0)la0 = i , la1 = la;
                else la1 = i , la0 = la;
            }else{
                if(e)la1 = i , la0 = i-1;
                else la0 = i , la1 = i-1;
            }
            bool ss = 1;
            for(auto q:adj[i]){
                if(q[1]==0){
                    if(la0<q[0]){
                        ss = 0;
                    }
                }else{
                    if(la1<q[0]){
                        ss = 0;
                    }
                }
            }
            if(ss){
                if(la0==i&&solve(i+1,la1,0)){
                    cout<<e<<" ";
                    print(i+1,la1,0);
                    break;
                }else{
                    cout<<e<<" ";
                    print(i+1,la0,1);
                    break;
                }
            }
        }
    }else{
        for(int e = lol[i];e<=lol[i];e++){
            int la0 =0, la1 = 0;
            if(e==dd){
                if(dd==0)la0 = i , la1 = la;
                else la1 = i , la0 = la;
            }else{
                if(e)la1 = i , la0 = i-1;
                else la0 = i , la1 = i-1;
            }
            bool ss = 1;
            for(auto q:adj[i]){
                if(q[1]==0){
                    if(la0<q[0]){
                        ss = 0;
                    }
                }else{
                    if(la1<q[0]){
                        ss = 0;
                    }
                }
            }
            if(ss){
                if(la0==i&&solve(i+1,la1,0)){
                    cout<<e<<" ";
                    print(i+1,la1,0);
                    break;
                }else{
                    cout<<e<<" ";
                    print(i+1,la0,1);
                    break;
                }
            }
        }
    }
}
signed main(){
    ios_base::sync_with_stdio(false);cin.tie(0);
    int m;
    cin>>n>>m;
    bool ss = 1;
    memset(lol,-1,sizeof lol);
    for(int i = 0;i<m;i++){
        int l,r,k,v;
        cin>>l>>r>>k>>v;
        l++;r++;
        if(k==1&&v==1){
            for(int j = l;j<=r;j++){
                if(lol[j]==0){
                    ss = 0;
                }
                lol[j] = 1;
            }
        }else if(k==(r-l+1)&&v==0){
            for(int j = l;j<=r;j++){
                if(lol[j]==1){
                    ss = 0;
                }
                lol[j] = 0;
            }
        }else{
            if(k==1){
                adj[r].push_back({l,0});
                //cout<<l<<" "<<r<<" "<<0<<"pp"<<endl;
            }else{
                adj[r].push_back({l,1});
                //cout<<l<<" "<<r<<" "<<1<<"pp"<<endl;
            }
        }
    }
    if(ss==0){
        cout<<-1<<endl;
        return 0;
    }
    if(solve(1,0,2)==0){
        cout<<-1<<endl;
        return 0;
    }
    print(1,0,2);
}