1
#include <bits/stdc++.h>
2
using namespace std;
3
#define int long long
4

5
struct Node {
6
    int l, r;
7
    mutable int v;               // mutable 讓 set 可以修改 v
8
    Node(int L, int R = 0, int V = 0) : l(L), r(R), v(V) {}
9
    bool operator<(const Node& o) const { return l < o.l; }
10
};
11

12
set<Node> ct;
13
using iter = set<Node>::iterator;
14

15
int n, m, seed, vmax;
16

17
// 關鍵：把位置 x 拆成一個區間的左端點
18
iter split(int pos) {
19
    if (pos > n) return ct.end();
20
    auto it = ct.lower_bound(Node(pos));
21
    if (it != ct.end() && it->l == pos) return it;
22
    --it;                                    // 找到涵蓋 pos 的區間
23
    int l = it->l, r = it->r, v = it->v;
24
    ct.erase(it);
25
    ct.insert(Node(l, pos - 1, v));
26
    return ct.insert(Node(pos, r, v)).first;
27
}
28

29
// 區間賦值 [l,r] = v
30
void assign_val(int l, int r, int v) {
31
    auto itr = split(r + 1), itl = split(l);
32
    ct.erase(itl, itr);
33
    ct.insert(Node(l, r, v));
34
}
35

36
// 區間加法 [l,r] += v
37
void add_val(int l, int r, int v) {
38
    auto itr = split(r + 1), itl = split(l);
39
    for (; itl != itr; ++itl)
40
        itl->v += v;
41
}
42

43
// 區間第 k 小
44
int kth(int l, int r, int k) {
45
    vector<pair<int, int>> vec;
46
    auto itr = split(r + 1), itl = split(l);
47
    for (auto it = itl; it != itr; ++it)
48
        vec.emplace_back(it->v, it->r - it->l + 1);
49
    sort(vec.begin(), vec.end());
50
    for (auto& p : vec) {
51
        k -= p.second;
52
        if (k <= 0) return p.first;
53
    }
54
    return -1;
55
}
56

57
// 快速冪
58
int powmod(int a, int b, int mod) {
59
    int res = 1; a %= mod;
60
    for (; b; b >>= 1) {
61
        if (b & 1) res = res * a % mod;
62
        a = a * a % mod;
63
    }
64
    return res;
65
}
66

67
// 區間冪和
68
int query_pow(int l, int r, int x, int y) {
69
    auto itr = split(r + 1), itl = split(l);
70
    int res = 0;
71
    for (; itl != itr; ++itl) {
72
        int len = itl->r - itl->l + 1;
73
        res = (res + len * powmod(itl->v, x, y)) % y;
74
    }
75
    return res;
76
}
77

78
signed main() {
79
    cin >> n >> m >> seed >> vmax;
80
    auto rnd = [&]() -> int {
81
        int ret = seed;
82
        seed = (seed * 7 + 13) % 1000000007LL;
83
        return ret;
84
    };
85

86
    for (int i = 1; i <= n; ++i)
87
        ct.insert(Node(i, i, rnd() % vmax + 1));
88

89
    for (int i = 1; i <= m; ++i) {
90
        int op = rnd() % 4 + 1;
91
        int l = rnd() % n + 1, r = rnd() % n + 1;
92
        if (l > r) swap(l, r);
93
        int x, y = 0;
94
        if (op == 3) x = rnd() % (r - l + 1) + 1;
95
        else x = rnd() % vmax + 1;
96
        if (op == 4) y = rnd() % vmax + 1;
97

98
        if (op == 1) add_val(l, r, x);
99
        else if (op == 2) assign_val(l, r, x);
100
        else if (op == 3) cout << kth(l, r, x) << '\n';
101
        else cout << query_pow(l, r, x, y) << '\n';
102
    }
103
    return 0;
104
}