#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <unordered_set>
using namespace std;
#define pb push_back
#define eb emplace_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
int logs[100001];
int sparce[17][1000001];

int askmin(int l, int r) {
    int level = logs[r - l + 1];
    return min(sparce[level][l], sparce[level][r - (1 << level) + 1]);
}

void solve() {
    //freopen("floyd.in", "r", stdin);
    //freopen("floyd.out", "w", stdout);
    int n, m, a, u, v;
    cin >> n >> m >> a >> u >> v;
    logs[0] = logs[1] = 0;
    for (int i = 2; i <= 100000; i++) {
        logs[i] = logs[i / 2] + 1;
    }
    sparce[0][0] = a;
    for (int i = 1; i < n; i++) {
        a = (23 * a + 21563) % 16714589;
        sparce[0][i] = a;
    }
    for (int level = 1; (1 << level) <= n; level++) {
        for (int i = 0; i + (1 << level) <= n; i++) {
            sparce[level][i] = min(sparce[level - 1][i], sparce[level - 1][i + (1 << (level - 1))]);
        }
    }
    int ans = askmin(min(u, v), max(u, v));
    cout << u << " " << v << " " << ans << "\n";
    for (int i = 1; i < m; i++) {
        u = ((17 * u + 751 + ans + 2 *i) % n) + 1;
        v = ((13 * v + 593 + ans + 5 * i) % n) + 1;
        ans = askmin(min(u, v), max(u, v));
        cout << u << " " << v << " " << ans << "\n";
    }
//  cout << u << " " << v << " " << ans;
}

signed main() {

    solve();
}