#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void read(T& x) {
  T f = 1;
  x = 0;
  char ch = getchar();
  while (0 == isdigit(ch)) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (0 != isdigit(ch)) x = (x << 1) + (x << 3) + ch - '0', ch = getchar();
  x *= f;
}
template <typename T>
inline void write(T x) {
  if (x < 0) {
    x = ~(x - 1);
    putchar('-');
  }
  if (x > 9) write(x / 10);
  putchar(x % 10 + '0');
}
const int inf = 0x3f3f3f3f;
const int N = 1e6 + 100;
struct Node {
  int l, r;
  mutable long long val;
  Node(int l, int r, long long val) : l(l), r(r), val(val) {}
  Node(int l) : l(l) {}
  bool operator<(const Node& t) const { return l < t.l; }
};
set<Node> st;
set<Node>::iterator split(int pos) {
  auto it = st.lower_bound(Node(pos));
  if (it != st.end() && it->l == pos) return it;
  it--;
  int l = it->l, r = it->r;
  long long val = it->val;
  st.erase(it);
  st.insert(Node(l, pos - 1, val));
  return st.insert(Node(pos, r, val)).first;
}
void assign(int l, int r, long long val) {
  auto itr = split(r + 1), itl = split(l);
  st.erase(itl, itr);
  st.insert(Node(l, r, val));
}
void add(int l, int r, long long val) {
  auto itr = split(r + 1), itl = split(l);
  for (auto it = itl; it != itr; it++) it->val += val;
}
long long kth(int l, int r, int k) {
  auto itr = split(r + 1), itl = split(l);
  vector<pair<long long, int>> node;
  for (auto it = itl; it != itr; it++)
    node.emplace_back(it->val, it->r - it->l + 1);
  sort(node.begin(), node.end());
  for (auto it : node) {
    k -= it.second;
    if (k <= 0) return it.first;
  }
  return -1;
}
long long q_pow(long long a, long long b, long long mod) {
  long long ans = 1;
  a %= mod;
  while (b) {
    if (b & 1) ans = ans * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return ans;
}
long long query(int l, int r, int x, int mod) {
  auto itr = split(r + 1), itl = split(l);
  long long ans = 0;
  for (auto it = itl; it != itr; it++)
    ans = (ans + q_pow(it->val, x, mod) * (it->r - it->l + 1)) % mod;
  return ans;
}
long long seed;
int rnd() {
  int ret = seed;
  seed = (seed * 7 + 13) % 1000000007;
  return ret;
}
int main() {
  int n, m, vmax;
  read(n), read(m), read(seed), read(vmax);
  for (int i = 1; i <= n; i++) {
    int num = rnd() % vmax + 1;
    st.insert(Node(i, i, num));
  }
  for (int i = 1; i <= m; i++) {
    int op = rnd() % 4 + 1, l = rnd() % n + 1, r = rnd() % n + 1, x, y;
    if (l > r) swap(l, r);
    if (op == 3)
      x = rnd() % (r - l + 1) + 1;
    else
      x = rnd() % vmax + 1;
    if (op == 4) y = rnd() % vmax + 1;
    if (op == 1)
      add(l, r, x);
    else if (op == 2)
      assign(l, r, x);
    else if (op == 3)
      write(kth(l, r, x)), putchar('\n');
    else if (op == 4)
      write(query(l, r, x, y)), putchar('\n');
  }
  return 0;
}
