#include <bits/stdc++.h>
const int MAXN = 100000;
const int MOD = 1000000007;
using namespace std;
inline int read() {
  int x = 0, w = 1;
  char c = ' ';
  while (c < '0' || c > '9') {
    c = getchar();
    if (c == '-') w = -1;
  }
  while (c >= '0' && c <= '9') {
    x = (x << 1) + (x << 3) + (c ^ 48);
    c = getchar();
  }
  return x * w;
}
long long ksm(int x, int k, long long m) {
  if (!k) return 1;
  long long tmp = ksm(x, k / 2, m) % m;
  if (k % 2)
    return tmp * tmp % m * x % m;
  else
    return tmp * tmp % m;
}
struct ChthollyTree {
  struct Node {
    int l, r;
    mutable long long v;
    bool operator<(const Node &rhs) const { return l < rhs.l; }
    Node(int _l, int _r = -1, long long _v = 0) {
      l = _l;
      r = _r;
      v = _v;
    }
  };
  set<Node> S;
  vector<pair<long long, int> > V;
  set<Node>::iterator split(int pos) {
    set<Node>::iterator it = S.lower_bound(Node(pos));
    if (it != S.end() && it->l == pos) return it;
    --it;
    if (pos > it->r) return S.end();
    int l = it->l, r = it->r;
    long long v = it->v;
    S.erase(it);
    S.insert(Node(l, pos - 1, v));
    return S.insert(Node(pos, r, v)).first;
  }
  void add(int l, int r, int num) {
    split(l);
    set<Node>::iterator itr = split(r + 1), itl = split(l);
    for (set<Node>::iterator it = itl; it != itr; ++it) it->v += num;
  }
  void update(int l, int r, int num) {
    split(l);
    set<Node>::iterator itr = split(r + 1), itl = split(l);
    S.erase(itl, itr);
    S.insert(Node(l, r, num));
  }
  long long getRank(int l, int r, int k) {
    V.clear();
    split(l);
    set<Node>::iterator itr = split(r + 1), itl = split(l);
    for (set<Node>::iterator it = itl; it != itr; ++it)
      V.push_back(make_pair(it->v, it->r - it->l + 1));
    sort(V.begin(), V.end());
    vector<pair<long long, int> >::iterator it;
    for (it = V.begin(); it != V.end(); ++it) {
      k -= it->second;
      if (k <= 0) return it->first;
    }
    return -1LL;
  }
  long long query(int l, int r, int x, long long mod) {
    split(l);
    set<Node>::iterator itr = split(r + 1), itl = split(l);
    long long ret = 0;
    for (set<Node>::iterator it = itl; it != itr; ++it)
      ret = (ret % mod + (long long)(it->r - it->l + 1) % mod *
                             ksm(it->v % mod, x, mod) % mod) %
            mod;
    return ret;
  }
  void insert(int l, int r, int num) { S.insert(Node(l, r, num)); }
  void debug() {
    for (set<Node>::iterator it = S.begin(); it != S.end(); ++it)
      cout << it->l << ' ' << it->r << ' ' << it->v << endl;
    cout << endl;
  }
} C;
int n, m, vmax;
int a[MAXN + 5];
long long seed;
int rnd() {
  int ret = seed;
  seed = (seed * 7 + 13) % MOD;
  return ret;
}
void init() {
  n = read();
  m = read();
  seed = read();
  vmax = read();
  for (int i = 1; i <= n; ++i) {
    a[i] = rnd() % vmax + 1;
    C.insert(i, i, a[i]);
  }
}
int main() {
  init();
  for (int i = 1; i <= m; ++i) {
    int opt = rnd() % 4 + 1;
    int l = rnd() % n + 1, r = rnd() % n + 1, x, y;
    if (l > r) swap(l, r);
    if (opt == 3)
      x = rnd() % (r - l + 1) + 1;
    else
      x = rnd() % vmax + 1;
    if (opt == 4) y = rnd() % vmax + 1;
    switch (opt) {
      case 1:
        C.add(l, r, x);
        break;
      case 2:
        C.update(l, r, x);
        break;
      case 3:
        printf("%I64d\n", C.getRank(l, r, x));
        break;
      case 4:
        printf("%I64d\n", C.query(l, r, x, y));
        break;
    }
  }
  return 0;
}
