#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pi pair<int,int>
#define vi vector<int>
#define pb push_back
#define all(a) a.begin(),a.end()
void solve(){
int n,m; cin >> n >> m;
vector<int> dp(n+1,1e9);
dp[0] = 0;
vector<array<int,3>> edge;
for(int i = 0; i < m; i++){
int l,r,k,v; cin >> l >> r >> k >> v;
l++,r++;
if(v==0) edge.push_back({l-1,r,r-l+1-k});
else edge.push_back({r,l-1,k - 1 - (r-l+1)});
}
for(int i = 1; i <= n; i++){
edge.push_back({i-1,i,1});
edge.push_back({i,i-1,0});
}
bool st = 0;
for(int i = 0; i < n; i++){
st = 0;
for(auto [u,v,c] : edge){
if(dp[v] > dp[u]+c){
dp[v] = dp[u]+c; st = 1;
}
}
}
if(st){
cout << -1; return;
}
for(int i = 1; i <= n; i++)
cout << dp[i]-dp[i-1] << ' ';
}
signed main(){
cin.tie(0)->sync_with_stdio(0);
int t = 1;
// cin >> t;
for(int i = 0; i < t; i++){solve();}
}
