#include <iostream>
#include <algorithm>
#include <queue>

typedef long long ll;
typedef double lf;

// #define DEBUG 1
struct IO
{
    #define MAXSIZE (1 << 20)
    #define isdigit(x) (x >= '0' && x <= '9')
    char buf[MAXSIZE], *p1, *p2;
    char pbuf[MAXSIZE], *pp;
    #if DEBUG
    #else
    IO() : p1(buf), p2(buf), pp(pbuf) {}
    ~IO() {fwrite(pbuf, 1, pp - pbuf, stdout);}
    #endif
    #define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) (x == ' ' || x == '\n' || x == '\r' || x == '\t')

    template <typename T>
    void Read(T &x)
    {
        #if DEBUG
        std::cin >> x;
        #else
        bool sign = 0; char ch = gc(); x = 0;
        for (; !isdigit(ch); ch = gc())
            if (ch == '-') sign = 1;
        for (; isdigit(ch); ch = gc()) x = x * 10 + (ch ^ 48);
        if (sign) x = -x;
        #endif
    }
    void Read(char *s)
    {
        #if DEBUG
        std::cin >> s;
        #else
        char ch = gc();
        for (; blank(ch); ch = gc());
        for (; !blank(ch); ch = gc()) *s++ = ch;
        *s = 0;
        #endif
    }
    void Read(char &c) {for (c = gc(); blank(c); c = gc());}

    void Push(const char &c)
    {
        #if DEBUG
        putchar(c);
        #else
        if (pp - pbuf == MAXSIZE) fwrite(pbuf, 1, MAXSIZE, stdout), pp = pbuf;
        *pp++ = c;
        #endif
    }
    template <typename T>
    void Write(T x)
    {
        if (x < 0) x = -x, Push('-');
        static T sta[35];
        int top = 0;
        do sta[top++] = x % 10, x /= 10; while (x);
        while (top) Push(sta[--top] ^ 48);
    }
    template <typename T>
    void Write(T x, char lst) {Write(x), Push(lst);}
} IO;
#define Read(x) IO.Read(x)
#define Write(x, y) IO.Write(x, y)
#define Put(x) IO.Push(x)

using namespace std;

const int MAXN = 5010, MAXM = 1e4 + 10;

int n, m;
struct Edge
{
    int v, nxt, w;
}e[MAXM << 2];
int head[MAXN], tot;
inline void AddEdge(int u, int v, int w)
{
    // cout << u << ' ' << v << " " << w << '\n';
    e[++tot] = Edge{v, head[u], w}, head[u] = tot;
}

ll dis[MAXN]; int h[MAXN];
bool vis[MAXN];
queue <int> q;
inline bool SPFA()
{
    for (int i = 1; i <= n; i++) dis[i] = 1e18;
    q.push(0), h[0] = 1;
    while (!q.empty())
    {
        int u = q.front(); q.pop();
        vis[u] = 0;
        for (int i = head[u]; i; i = e[i].nxt)
        {
            int v = e[i].v;
            if (dis[v] > dis[u] + e[i].w)
            {
                dis[v] = dis[u] + e[i].w, h[v] = h[u] + 1;
                if (h[v] > n + 1) return 0;
                if (!vis[v]) vis[v] = 1, q.push(v);
            }
        }
    }
    return 1;
}

int main()
{
    #if DEBUG
    #else
    ios::sync_with_stdio(0), cin.tie(0);
    #endif
    Read(n), Read(m);
    for (int i = 1, l, r, k, tp; i <= m; i++)
    {
        Read(l), Read(r), Read(k), Read(tp); l++, r++;
        if (tp) AddEdge(r, l - 1, k - (r - l + 1) - 1);
        else AddEdge(l - 1, r, r - l + 1 - k);
    }
    for (int i = 0; i < n; i++) AddEdge(i + 1, i, 0), AddEdge(i, i + 1, 1);
    bool flag = SPFA();
    if (flag)
    {
        for (int i = 1; i <= n; i++) cout << dis[i] - dis[i - 1] << ' ';
        cout << '\n';
    }
    else cout << "-1\n";
    return 0;
}