#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define pb push_back
#define ALL(v) v.begin(), v.end()
#define SZ(a) ((int)a.size())

unsigned int s;
unsigned int getNext() {
    s = s ^ (s<<13);
    s = s ^ (s>>17);
    s = s ^ (s<<5);
    return s;
}

const int N = 1e7 + 5;
int g[N];
int f(int x) { return g[x] = (g[x] == x ? x : f(g[x])); }
bool mg(int a, int b) {
    a = f(a), b = f(b);
    if (a == b) return false;
    g[a] = b;
    return true;
}

struct Edge { int a, b; ll c; int idx; };

unsigned int ans[N];

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int n, m;
    cin >> n >> m >> s;
    vector<Edge> v;
    for (int i = 0; i < m; i++) {
        int a = getNext() % n; 
        int b = getNext() % n; 
        ll w = getNext() / 4;
        w = w * getNext();
        // cerr << a << " " << b << " " << w << endl;
        v.pb({a, b, w, i});
    }
    // vector<int> dt(m);
    // iota(ALL(dt), 0);
    // sort(ALL(dt), [&](const auto &a, const auto &b) { return v[a].c < v[b].c; });
    sort(ALL(v), [&](const auto &a, const auto &b) { return a.c < b.c; });
    for (int i = 0; i < n; i++)
        g[i] = i;
    vector<int> cs;
    int cnt = 0;
    // for (auto idx : dt) {
    //     const auto &e = v[idx]; 
    for (const auto &e : v) {
        if (mg(e.a, e.b)) {
            cnt++;
            int idx = e.idx;
            ans[idx >> 5] |= (1u << (idx & 31));
        }
        cs.pb(cnt);
    }
    int na = (m - 1) / 32 + 1;
    for (int i = 0; i < na; i++)
        cout << ans[i] << " \n"[i + 1 == na];
    // cerr << cnt << " " << fixed << setprecision(5) << (double)cnt / m << endl;
}