#include <bits/stdc++.h>
using namespace std;
struct Data {
  long long st, dr, val;
  bool operator<(const Data& other) const { return st < other.st; }
} v[100005];
set<Data> s;
struct Sort {
  long long nr, val;
  bool operator<(const Sort& other) const { return val < other.val; }
} v1[100005];
long long seed;
long long rnd() {
  long long ret = seed;
  seed = (1LL * seed * 7 + 13) % 1000000007;
  return ret;
}
long long myPow(long long a, long long b, long long mod) {
  long long ans = 1;
  for (; b; b >>= 1) {
    if (b & 1) ans = 1LL * ans * a % mod;
    a = 1LL * a * a % mod;
  }
  return ans;
}
int main() {
  long long n, m, vmax;
  scanf("%I64d%I64d%I64d%I64d", &n, &m, &seed, &vmax);
  for (long long i = 1; i <= n; ++i) {
    long long x = (rnd() % vmax) + 1;
    s.insert({i, i, x});
  }
  for (long long j = 1; j <= m; ++j) {
    long long op, l, r, x, y;
    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;
    else
      x = rnd() % vmax + 1;
    if (op == 4) {
      y = rnd() % vmax + 1;
    }
    long long a = l, b = r;
    set<Data>::iterator it = s.lower_bound({a, 0, 0});
    long long p = 0;
    while (it != s.end() && it->dr <= b) {
      v[++p] = {it->st, it->dr, it->val};
      s.erase(it);
      it = s.lower_bound({a, 0, 0});
    }
    it = s.lower_bound({a, 0, 0});
    if (it != s.end() && it->st <= b) {
      v[++p] = {it->st, b, it->val};
      long long dr1 = it->dr;
      long long val1 = it->val;
      s.erase(it);
      s.insert({b + 1, dr1, val1});
    }
    it = s.lower_bound({a, 0, 0});
    if (it != s.begin()) {
      it--;
      if (it->dr >= a) {
        v[++p] = {a, min(it->dr, b), it->val};
        long long st1 = it->st;
        long long dr1 = it->dr;
        long long val1 = it->val;
        s.erase(it);
        s.insert({st1, a - 1, val1});
        if (b < dr1) s.insert({b + 1, dr1, val1});
      }
    }
    if (op == 2) {
      s.insert({l, r, x});
    } else if (op == 1) {
      for (long long i = 1; i <= p; ++i)
        s.insert({v[i].st, v[i].dr, v[i].val + x});
    } else if (op == 3) {
      for (long long i = 1; i <= p; ++i) {
        v1[i] = {v[i].dr - v[i].st + 1, v[i].val};
        s.insert(v[i]);
      }
      sort(v1 + 1, v1 + p + 1);
      long long nr = 0, ind = 1, val;
      while (ind <= p && nr < x) {
        val = v1[ind].val;
        nr += v1[ind].nr;
        ind++;
      }
      printf("%I64d\n", val);
    } else {
      long long ans = 0;
      for (long long i = 1; i <= p; ++i) {
        ans = (1LL * ans +
               (v[i].dr - v[i].st + 1) * myPow(v[i].val % y, x, y) % y) %
              y;
        s.insert(v[i]);
      }
      printf("%I64d\n", ans);
    }
  }
  return 0;
}
