#include <bits/stdc++.h>
using namespace std;
struct node {
  long long l, r;
  mutable long long v;
  node() {}
  node(long long _l, long long _r, long long _v) : l(_l), r(_r), v(_v) {}
  const bool operator<(const node& x) const { return l < x.l; }
};
set<node> s;
long long n, m, seed, vmax, op, l, r, x, y;
long long a[100005];
long long rnd(long long mod) {
  long long ret = seed;
  seed = (seed * 7 + 13) % 1000000007;
  return ret % mod + 1;
}
long long fpow(long long a, long long b, long long mod) {
  long long res = 1, ans = a % mod;
  while (b) {
    if (b & 1) res = res * ans % mod;
    ans = ans * ans % mod;
    b >>= 1;
  }
  return res;
}
set<node>::iterator split(long long pos) {
  set<node>::iterator it = s.lower_bound(node(pos, 0, 0));
  if (it != s.end() && it->l == pos) return it;
  it--;
  long long l = it->l, r = it->r, v = it->v;
  s.erase(it);
  s.insert(node(l, pos - 1, v));
  return s.insert(node(pos, r, v)).first;
}
void assign(long long l, long long r, long long v) {
  set<node>::iterator itr = split(r + 1), itl = split(l);
  s.erase(itl, itr);
  s.insert(node(l, r, v));
}
void add(long long l, long long r, long long x) {
  set<node>::iterator itr = split(r + 1), itl = split(l);
  for (; itl != itr; itl++) itl->v += x;
}
long long kth(long long l, long long r, long long k) {
  vector<pair<long long, long long> > vec;
  set<node>::iterator itr = split(r + 1), itl = split(l);
  for (; itl != itr; itl++)
    vec.push_back(make_pair(itl->v, itl->r - itl->l + 1));
  sort(vec.begin(), vec.end());
  for (int i = 0; i < vec.size(); i++) {
    k -= vec[i].second;
    if (k <= 0) return vec[i].first;
  }
}
long long sum(long long l, long long r, long long x, long long y) {
  long long res = 0;
  set<node>::iterator itr = split(r + 1), itl = split(l);
  for (; itl != itr; itl++)
    res = (res + (itl->r - itl->l + 1) % y * fpow(itl->v, x, y) % y) % y;
  return res;
}
int main() {
  scanf("%lld%lld%lld%lld", &n, &m, &seed, &vmax);
  for (int i = 1; i <= n; i++) {
    a[i] = rnd(vmax);
    s.insert(node(i, i, a[i]));
  }
  for (int i = 1; i <= m; i++) {
    op = rnd(4), l = rnd(n), r = rnd(n);
    if (l > r) swap(l, r);
    if (op == 3)
      x = rnd(r - l + 1);
    else
      x = rnd(vmax);
    if (op == 4) y = rnd(vmax);
    switch (op) {
      case 1:
        add(l, r, x);
        break;
      case 2:
        assign(l, r, x);
        break;
      case 3:
        printf("%lld\n", kth(l, r, x));
        break;
      case 4:
        printf("%lld\n", sum(l, r, x, y));
        break;
    }
  }
  return 0;
}
