#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 55;
const long long moo = 1e9 + 7;
long long ret, seed, op, l, r, x, y;
long long rnd() {
  ret = seed;
  seed = (1ll * seed * 7 % moo + 13) % moo;
  return ret;
}
long long n, m, mod, a[N];
struct node {
  long long l, r;
  mutable long long v;
  friend bool operator<(node x, node y) { return x.l < y.l; }
};
set<node> s;
long long ksm(long long x, long long k, long long mo) {
  long long base = 1;
  while (k) {
    if (k & 1) base = 1ll * base * x % mo;
    x = 1ll * x * x % mo;
    k >>= 1;
  }
  return base;
}
set<node>::iterator split(long long pos) {
  set<node>::iterator it;
  it = s.lower_bound(node{pos, 0, 0});
  if (it->l == pos and it != s.end()) return it;
  it--;
  long long l = it->l;
  long long r = it->r;
  long long val = it->v;
  s.erase(it);
  s.insert((node){l, pos - 1, val});
  it = s.insert((node){pos, r, val}).first;
  return it;
}
void assign(long long l, long long r, long long val) {
  set<node>::iterator it1, it2;
  it1 = split(l);
  it2 = split(r + 1);
  s.erase(it1, it2);
  s.insert((node){l, r, val});
}
void add(long long l, long long r, long long val) {
  set<node>::iterator it1, it2;
  it1 = split(l);
  it2 = split(r + 1);
  for (; it1 != it2; it1++) {
    it1->v += val;
  }
}
long long top;
struct stt {
  long long len, val;
} st[N];
long long cmp(stt x, stt y) { return x.val < y.val; }
long long kth(long long l, long long r, long long x) {
  set<node>::iterator it1, it2;
  it1 = split(l);
  it2 = split(r + 1);
  top = 0;
  for (; it1 != it2; it1++) {
    st[++top] = {it1->r - it1->l + 1, it1->v};
  }
  sort(st + 1, st + top + 1, cmp);
  for (long long k = 1; k <= top; k++) {
    if (x <= st[k].len) {
      return st[k].val;
    }
    x -= st[k].len;
  }
}
long long sum(long long l, long long r, long long x, long long mo) {
  set<node>::iterator it1, it2;
  it1 = split(l);
  it2 = split(r + 1);
  long long ans = 0;
  for (; it1 != it2; it1++) {
    ans = (ans + 1ll * ksm((it1->v) % mo, x, mo) * (it1->r - it1->l + 1) % mo) %
          mo;
  }
  return ans;
}
signed main() {
  cin >> n >> m >> seed >> mod;
  for (long long i = 1; i <= n; i++) {
    a[i] = (rnd() % mod) + 1;
    node z = {i, i, a[i]};
    s.insert(z);
  }
  s.insert(node{n + 1, n + 1, -1});
  long long js = 0;
  for (long long i = 1; i <= m; i++) {
    op = (rnd() % 4) + 1;
    l = (rnd() % n) + 1;
    r = (rnd() % n) + 1;
    if (l > r) swap(l, r);
    if (op == 3) {
      x = (rnd() % (r - l + 1)) + 1;
      js++;
    } else {
      x = (rnd() % mod) + 1;
    }
    if (op == 4 and js == 100) {
      new char;
    }
    if (op == 4) {
      y = (rnd() % mod) + 1;
      js++;
    }
    if (js == 158) {
      new char;
    }
    if (op == 1) add(l, r, x);
    if (op == 2) assign(l, r, x);
    if (op == 3) printf("%lld\n", kth(l, r, x));
    if (op == 4) printf("%lld\n", sum(l, r, x, y));
  }
  return 0;
}
