#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const int LIM=5e5+7, LG=23;
pair<ll,ll>F[LG][LIM];
ll mod(ll x, ll k) {
	return ((x%k)+k)%k;
}
pair<ll,ll>fnd(ll k, ll x) {
	if(F[k][x].st==x) return {x, 0};
	pair<ll,ll>p=fnd(k, F[k][x].st);
	F[k][x]={p.st, p.nd+F[k][x].nd};
	return F[k][x];
}
bool chk(ll a, ll b, ll c, ll k) {
	pair<ll,ll>x=fnd(k, a), y=fnd(k, b);
	if(x.st!=y.st) return true;
	return mod(-x.nd+y.nd+c, 1ll<<(k+1))==0;
}
void uni(ll a, ll b, ll c, ll k) {
	pair<ll,ll>x=fnd(k, a), y=fnd(k, b);
	if(x.st==y.st) return;
	ll z=mod(-x.nd+y.nd+c, 1ll<<(k+1));
	F[k][x.st]={y.st, z};
}
int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	int n, m;
	cin >> n >> m;
	rep(i, LG) rep(j, n) F[i][j]={j, 0};
	while(m--) {
		ll i, j, a, b;
		cin >> i >> j >> a >> b; --i; --j;
		ll k=0;
		while(k+1<LG && (1ll<<k)!=b) ++k;
		if(b!=-1) a+=1ll<<k;
		bool ok=true;
		rep(p, k+1) if(!chk(i, j, a, p)) ok=false;
		if(!ok) {
			cout << 0 << '\n';
			continue;
		}
		cout << 1 << '\n';
		rep(p, k+1) uni(i, j, a, p);
	}
}