#include <iostream>
#include <vector>
#include <string>
#include <iomanip>
#include <queue>
#include <cmath>
#include <algorithm>
#include <unordered_map>
#include <tuple>
#include <iomanip>
#include <stdio.h>
#include <map>
#include <bitset>
#include <set>
#include <stack>
#include <queue>
#include <unordered_set>
#include <cassert>
#include <stdlib.h>
#include <time.h>
#include <random>


//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,sse3,sse4")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("fast-math")
//#pragma GCC target("avx2")
//#pragma GCC optimize("section-anchors")
//#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
//#pragma GCC optimize("vpt")
//#pragma GCC optimize("rename-registers")
//#pragma GCC optimize("move-loop-invariants")
//#pragma GCC optimize("unswitch-loops")
//#pragma GCC optimize("function-sections")
//#pragma GCC optimize("data-sections")

#define int long long
#define ll long long
#define ull unsigned long long
#define all(a) (a).begin(), (a).end()
#define pii pair<int, int>
#define pb push_back
#define ld long double


using namespace std;

//const int INF = 1e17;
//const int mod = 2600000069;
//const int p = 179;
const int MAXN = 1e5 + 1;
const int logn = 18;
const int mod = 16714589;

int mn[MAXN][logn], a[MAXN];

int ask(int l, int r) {
    int t = log2(r - l);
    return min(mn[l][t], mn[r - (1 << t) + 1][t]);
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    freopen("sparse.in", "r", stdin);
    freopen("sparse.out", "w", stdout);
    int n, m, a1, u, v;
    cin >> n >> m >> a1 >> u >> v;
    a[0] = a1;
    for (int i = 1; i < n; i++) {
        a[i] = (23 * a[i - 1] + 21563) % mod;
    }
    for (int i = 0; i < n; i++) {
        mn[i][0] = a[i];
    }
    for (int l = 1; (1 << l) <= n; l++) {
        for (int i = 0; i <= n - (1 << l); i++) {
            mn[i][l] = min(mn[i][l - 1], mn[i + (1 << (l - 1))][l - 1]);
        }
    }
    int ansi;
    for (int i = 1; i < m; i++) {
        ansi = ask(min(u, v) - 1, max(u, v) - 1);
        u = ((17 * u + 751 + ansi + 2 * i) % n) + 1;
        v = ((13 * v + 593 + ansi + 5 * i) % n) + 1;
    }
    ansi = ask(min(u, v) - 1, max(u, v) - 1);
    cout << u << " " << v << " " << ansi << "\n";
}
/*

*/