#include <bits/stdc++.h>
using namespace std;
const int MOD7 = 1e9 + 7;
const int MOD9 = 1e9 + 9;
const int MAXN = 1e5 + 10;
inline long long qpow(long long a, long long b, long long mod) {
  long long res = 1;
  long long ans = a % mod;
  while (b) {
    if (b & 1) res = res * ans % mod;
    ans = ans * ans % mod;
    b >>= 1;
  }
  return res;
}
struct node {
  int l, r;
  mutable long long v;
  node() {}
  node(int L, int R = -1, long long V = 0) : l(L), r(R), v(V) {}
  bool operator<(const node& o) const { return l < o.l; }
};
set<node> s;
inline set<node>::iterator split(int pos) {
  set<node>::iterator it = s.lower_bound(node(pos));
  if (it != s.end() && it->l == pos) return it;
  --it;
  int L = it->l, R = it->r;
  long long V = it->v;
  s.erase(it);
  s.insert(node(L, pos - 1, V));
  return s.insert(node(pos, R, V)).first;
}
inline void add(int l, int r, long long val = 1) {
  set<node>::iterator itl = split(l), itr = split(r + 1);
  for (; itl != itr; ++itl) itl->v += val;
}
inline void assignval(int l, int r, long long val = 0) {
  set<node>::iterator itl = split(l), itr = split(r + 1);
  s.erase(itl, itr);
  s.insert(node(l, r, val));
}
inline long long rankk(int l, int r, int k) {
  vector<pair<long long, int> > vp;
  set<node>::iterator itl = split(l), itr = split(r + 1);
  vp.clear();
  for (; itl != itr; ++itl)
    vp.push_back(pair<long long, int>(itl->v, itl->r - itl->l + 1));
  sort(vp.begin(), vp.end());
  for (vector<pair<long long, int> >::iterator it = vp.begin(); it != vp.end();
       ++it) {
    k -= it->second;
    if (k <= 0) return it->first;
  }
  return -1LL;
}
inline long long sum(int l, int r, int ex, int mod) {
  set<node>::iterator itl = split(l), itr = split(r + 1);
  long long res = 0;
  for (; itl != itr; ++itl)
    res = (res + (long long)(itl->r - itl->l + 1) *
                     qpow(itl->v, (long long)(ex), (long long)(mod))) %
          mod;
  return res;
}
int n, m;
long long seed, vmax;
long long rnd() {
  long long ret = seed;
  seed = (seed * 7 + 13) % MOD7;
  return ret;
}
long long a[MAXN];
int main() {
  cin >> n >> m >> seed >> vmax;
  for (int i = 1; i <= n; i++) {
    a[i] = (rnd() % vmax) + 1;
    s.insert(node(i, i, a[i]));
  }
  s.insert(node(n + 1, n + 1, 0));
  int lines = 0;
  for (int i = 1; i <= m; i++) {
    int op = int(rnd() % 4) + 1;
    int l = int(rnd() % n) + 1;
    int r = int(rnd() % n) + 1;
    if (l > r) swap(l, r);
    int x, y;
    if (op == 3)
      x = int(rnd() % (r - l + 1)) + 1;
    else
      x = int(rnd() % vmax) + 1;
    if (op == 4) y = int(rnd() % vmax) + 1;
    if (op == 1)
      add(l, r, (long long)(x));
    else if (op == 2)
      assignval(l, r, (long long)(x));
    else if (op == 3)
      printf("%lld\n", rankk(l, r, x));
    else
      printf("%lld\n", sum(l, r, x, y));
  }
  return 0;
}
