#include <bits/stdc++.h>

using i64 = long long;
using u64 = unsigned long long;
using u32 = unsigned;
using u128 = unsigned __int128;

struct DSU {
    const int m;
    std::vector<int> f;
    std::vector<i64> e;
    DSU(int n, int m_) : f(n), e(n), m(m_) {
        std::iota(f.begin(), f.end(), 0);
    }
    
    int find(int x) {
        if (x == f[x]) {
            return x;
        }
        int y = find(f[x]);
        e[x] += e[f[x]];
        if (m) {
            e[x] %= m;
        }
        f[x] = y;
        return y;
    }
    
    bool canMerge(int x, int y, int w) {
        int u = find(x);
        int v = find(y);
        i64 s = w + e[y] - e[x];
        if (m) {
            s = (s % m + m) % m;
        }
        if (u == v && s != 0) {
            return false;
        }
        return true;
    }
    
    bool merge(int x, int y, int w) {
        int u = find(x);
        int v = find(y);
        i64 s = w + e[y] - e[x];
        if (m) {
            s = (s % m + m) % m;
        }
        if (u == v && s != 0) {
            return false;
        }
        f[u] = v;
        e[u] = s;
        return true;
    }
};

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int N, M;
    std::cin >> N >> M;
    
    std::vector<DSU> dsu;
    for (int i = 0; i <= 15; i++) {
        dsu.emplace_back(N, 1 << i);
    }
    dsu.emplace_back(N, 0);
    
    for (int i = 0; i < M; i++) {
        int x, y, A, B;
        std::cin >> x >> y >> A >> B;
        x--;
        y--;
        
        int u = B == -1 ? 16 : std::__lg(B);
        bool ok = true;
        for (int v = 0; v <= u; v++) {
            if (!dsu[v].canMerge(x, y, A)) {
                ok = false;
                break;
            }
        }
        if (!ok) {
            std::cout << 0 << "\n";
            continue;
        }
        std::cout << 1 << "\n";
        for (int v = 0; v <= u; v++) {
            dsu[v].merge(x, y, A);
        }
    }
    
    return 0;
}