#include <bits/stdc++.h>
using namespace std;
auto sol = [](int n, int m, auto v) {
vector buc(n + 1, vector(0, 0));
for (int i = 0; i < m; i++) {
buc[v[i][3]].push_back(i);
}
vector ret(n + 1, 0);
for (int i = 1; i <= n; i++) {
vector cnt(4, 0);
for (int p : buc[i]) {
int val = v[p][4];
val -= ret[v[p][0]];
val -= ret[v[p][1]];
val -= ret[v[p][2]];
while (val < 0) val += 4;
cnt[val]++;
}
int opt = 0;
for (int p = 1; p < 4; p++) {
if (cnt[opt] >= cnt[p]) continue;
opt = p;
}
ret[i] = opt;
}
return ret;
};
int main() {
cin.tie(0)->sync_with_stdio(0);
int n, m; cin >> n >> m;
vector v(m, array{ 0, 0, 0, 0, 0 });
for (auto& [a, b, c, d, x] : v) cin >> a >> b >> c >> d >> x;
auto res = sol(n, m, v);
for (int i = 1; i <= n; i++) cout << res[i] << ' ';
cout << '\n';
}
