#include <bits/stdc++.h>
inline void cmin(int &x, int y) {
  if (y < x) x = y;
}
inline void cmax(int &x, int y) {
  if (y > x) x = y;
}
using namespace std;
long long Power(long long Base, long long Exp, long long Mod) {
  Base %= Mod;
  long long res(1);
  do {
    if (Exp & 1) (res *= Base) %= Mod;
    (Base *= Base) %= Mod;
  } while (Exp >>= 1);
  return res;
}
long long seed;
int rnd() {
  int res(seed);
  seed = (seed * 7 + 13) % 1000000007;
  return res;
}
int N, M, V_Max;
map<int, long long> A;
int main() {
  cin >> N >> M >> seed >> V_Max;
  for (int i(1); i <= N; ++i)
    A.insert(A.end(), make_pair(i, rnd() % V_Max + 1));
  A.insert(A.end(), make_pair(N + 1, 0));
  while (M--) {
    int op((rnd() % 4) + 1);
    int l((rnd() % N) + 1);
    int r((rnd() % N) + 1);
    int x, y;
    if (l > r) swap(l, r);
    if (op == 3)
      x = (rnd() % (r - l + 1)) + 1;
    else
      x = (rnd() % V_Max) + 1;
    if (op == 4) y = (rnd() % V_Max) + 1;
    auto it_l(--A.upper_bound(l));
    if (it_l->first != l) A[l] = it_l->second, ++it_l;
    auto it_r(--A.upper_bound(r + 1));
    if (it_r->first != r + 1) A[r + 1] = it_r->second, ++it_r;
    switch (op) {
      static vector<pair<long long, int>> v;
      static long long res;
      case 1:
        while (it_l != it_r) (--it_r)->second += x;
        break;
      case 2:
        while (it_l != it_r) A.erase(it_l++);
        A[l] = x;
        break;
      case 3:
        v.clear();
        for (int ub; it_l != it_r;)
          ub = (it_r--)->first,
          v.push_back(make_pair(it_r->second, ub - it_r->first));
        sort(v.begin(), v.end());
        for (int i(0), cnt(0);; ++i)
          if (x <= (cnt += v[i].second)) {
            printf("%I64d\n", v[i].first);
            break;
          }
        break;
      case 4:
        res = 0;
        for (int ub; it_l != it_r;)
          ub = (it_r--)->first,
          (res += Power(it_r->second, x, y) * (ub - it_r->first)) %= y;
        printf("%I64d\n", res);
        break;
    }
  }
  return 0;
}
