#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
#pragma GCC optimize 03
#pragma GCC optimize("unroll-loops")

#include <iostream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <ctime>
#include <vector>
#include <deque>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <string>
#include <random>
#include <numeric>
#include <unordered_set>

typedef long long ll;
typedef long double lb;

#define fast ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define file_in freopen("input.txt", "r", stdin);
#define file_in_out freopen("knapsack.in", "r", stdin); freopen("knapsack.out", "w", stdout);
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second

using namespace std;

template<typename T>
istream& operator>>(istream &in, vector<T> &v) {
    for (auto &it : v) {
        in >> it;
    }
    return in;
}

template<typename T>
ostream& operator<<(ostream &out, vector<T> &v) {
    if (!v.empty()) {
        out << v.front();
        for (int i = 1; i < v.size(); ++i) {
            out << " " << v[i];
        }
    }
    return out;
}

const int LOG = 24, MAXN = 16714589;
//map<int, int> _log;
vector<vector<int>> spt;

int rmq(int l, int r) {
    //int t = _log[r - l + 1];
    int t = __lg(r - l + 1);
    return min(spt[l][t], spt[r - (1 << t) + 1][t]);
}

int main() {
    fast
//  file_in
//  file_in_out

    int n, m, a0, u, v;
    cin >> n >> m >> a0 >> u >> v;

    /*
    _log.resize(MAXN);
    _log[1] = 0;
    for (int i = 2; i <= MAXN; ++i) {
        _log[i] = _log[i / 2] + 1;
    }
    */

    spt.resize(n, vector<int>(LOG + 1));
    spt[0][0] = a0;
    for (int i = 1; i < n; ++i) {
        spt[i][0] = (23 * spt[i - 1][0] + 21563) % MAXN;
    }
    for (int j = 1; j <= LOG; j++) {
        for (int i = 0; i + (1 << j) <= n; i++) {
            spt[i][j] = min(spt[i][j - 1], spt[i + (1 << (j - 1))][j - 1]);
        }
    }
    int ans;
    for (int i = 1; i <= m; ++i) {
        if (u > v) {
            ans = rmq(v - 1, u - 1);
        } else {
            ans = rmq(u - 1, v - 1);
        }
        if (i == m) break;
        u = ((17 * u + 751 + ans + 2 * i) % n) + 1;
        v = ((13 * v + 593 + ans + 5 * i) % n) + 1;
    }
    cout << u << " " << v << " " << ans;
    return 0;
}