#include <bits/stdc++.h>
using namespace std;
const long long maxn = 100010, mod = 1e9 + 7;
struct node {
  long long l, r;
  mutable long long v;
  node(long long stdl, long long stdr = -1, long long stdv = 0)
      : l(stdl), r(stdr), v(stdv) {}
  bool operator<(const node &x) const { return l < x.l; }
};
long long qpow(long long x, long long y, long long p) {
  long long res = 1;
  long long ans = x % p;
  while (y) {
    if (y & 1) res = res * ans % p;
    ans = ans * ans % p;
    y >>= 1;
  }
  return res;
}
set<node> s;
set<node>::iterator split(long long x) {
  set<node>::iterator it = s.lower_bound(node(x));
  if (it != s.end() && it->l == x) return it;
  it--;
  long long stdl = it->l, stdr = it->r, stdv = it->v;
  s.erase(it);
  s.insert(node(stdl, x - 1, stdv));
  return s.insert(node(x, stdr, stdv)).first;
}
void assign(long long l, long long r, long long k) {
  set<node>::iterator stdr = split(r + 1), stdl = split(l);
  s.erase(stdl, stdr);
  s.insert(node(l, r, k));
}
void add(long long l, long long r, long long k) {
  set<node>::iterator stdr = split(r + 1), stdl = split(l);
  for (; stdl != stdr; ++stdl) stdl->v += k;
}
long long query_rank(long long l, long long r, long long k) {
  vector<pair<long long, long long> > vp;
  set<node>::iterator stdr = split(r + 1), stdl = split(l);
  vp.clear();
  for (; stdl != stdr; ++stdl)
    vp.push_back(pair<long long, long long>(stdl->v, stdl->r - stdl->l + 1));
  sort(vp.begin(), vp.end());
  for (vector<pair<long long, long long> >::iterator it = vp.begin();
       it != vp.end(); it++) {
    k -= it->second;
    if (k <= 0) return it->first;
  }
}
long long query_sum(long long l, long long r, long long k, long long p) {
  set<node>::iterator stdr = split(r + 1), stdl = split(l);
  long long res = 0;
  for (; stdl != stdr; ++stdl)
    res += (stdl->r - stdl->l + 1) * qpow(stdl->v, k, p), res %= p;
  return res;
}
long long n, m, seed, vmax, a[maxn];
long long rd() {
  long long ret = seed;
  seed = (seed * 7 + 13) % mod;
  return ret;
}
signed main() {
  scanf("%lld%lld%lld%lld", &n, &m, &seed, &vmax);
  for (long long i = 1; i <= n; i++)
    a[i] = rd() % vmax + 1, s.insert(node(i, i, a[i]));
  s.insert(node(n + 1, n + 1, 0));
  while (m--) {
    long long opt = (rd() % 4) + 1, l = (rd() % n) + 1, r = (rd() % n) + 1;
    if (l > r) swap(l, r);
    long long x, y;
    if (opt == 3)
      x = rd() % (r - l + 1) + 1;
    else
      x = rd() % vmax + 1;
    if (opt == 4) y = rd() % vmax + 1;
    if (opt == 1) add(l, r, x);
    if (opt == 2) assign(l, r, x);
    if (opt == 3) printf("%lld\n", query_rank(l, r, x));
    if (opt == 4) printf("%lld\n", query_sum(l, r, x, y));
  }
  return 0;
}
