#include <bits/stdc++.h>
using namespace std;
const long long maxn = 100000 + 5;
long long a[maxn];
long long n, m;
long long seed, vmax;
long long rnd() {
  long long ret = seed;
  seed = (seed * 7 + 13) % 1000000007;
  return ret;
}
long long mn[maxn << 2], mx[maxn << 2], lazy[maxn << 2];
void pushup(long long rt) {
  mx[rt] = max(mx[rt << 1], mx[rt << 1 | 1]);
  mn[rt] = min(mn[rt << 1], mn[rt << 1 | 1]);
}
void pushdown(long long rt) {
  if (lazy[rt]) {
    mn[rt << 1] = mx[rt << 1] = lazy[rt << 1] = lazy[rt];
    mn[rt << 1 | 1] = mx[rt << 1 | 1] = lazy[rt << 1 | 1] = lazy[rt];
    lazy[rt] = 0;
  }
}
void build(long long l, long long r, long long rt) {
  if (l == r) {
    mn[rt] = mx[rt] = a[l];
    return;
  }
  long long mid = (l + r) >> 1;
  build(l, mid, rt << 1);
  build(mid + 1, r, rt << 1 | 1);
  pushup(rt);
}
void op1(long long L, long long R, long long l, long long r, long long rt,
         long long x) {
  if (L <= l && r <= R && mx[rt] == mn[rt]) {
    mx[rt] = mn[rt] = lazy[rt] = x + mn[rt];
    return;
  }
  int mid = (l + r) >> 1;
  pushdown(rt);
  if (L <= mid) {
    op1(L, R, l, mid, rt << 1, x);
  }
  if (R > mid) {
    op1(L, R, mid + 1, r, rt << 1 | 1, x);
  }
  pushup(rt);
}
void op2(long long L, long long R, long long l, long long r, long long rt,
         long long x) {
  if (L <= l && r <= R) {
    mx[rt] = mn[rt] = lazy[rt] = x;
    return;
  }
  int mid = (l + r) >> 1;
  pushdown(rt);
  if (L <= mid) {
    op2(L, R, l, mid, rt << 1, x);
  }
  if (R > mid) {
    op2(L, R, mid + 1, r, rt << 1 | 1, x);
  }
  pushup(rt);
}
vector<pair<long long, long long> > v;
void get(long long L, long long R, long long l, long long r, long long rt) {
  if (L <= l && R >= r && mn[rt] == mx[rt]) {
    v.push_back(make_pair(mn[rt], r - l + 1));
    return;
  }
  pushdown(rt);
  long long mid = (l + r) >> 1;
  if (L <= mid) {
    get(L, R, l, mid, rt << 1);
  }
  if (R > mid) {
    get(L, R, mid + 1, r, rt << 1 | 1);
  }
}
long long op3(long long l, long long r, long long x) {
  v.clear();
  get(l, r, 1, n, 1);
  sort(v.begin(), v.end());
  for (size_t i = 0; i < v.size(); i++) {
    if (x <= v[i].second) {
      return v[i].first;
    }
    x -= v[i].second;
  }
}
long long pow_mod(long long a, long long b, long long mod) {
  long long res = 1;
  while (b) {
    if (b & 1) {
      res = res * a % mod;
    }
    b >>= 1;
    a = a * a % mod;
  }
  return res;
}
long long op4(long long l, long long r, long long x, long long y) {
  v.clear();
  get(l, r, 1, n, 1);
  sort(v.begin(), v.end());
  long long preFirst = 0, preSecond = 0, res = 0;
  for (size_t i = 0; i < v.size(); i++) {
    if (v[i].first != preFirst) {
      res = (res + preSecond * pow_mod(preFirst % y, x, y) % y) % y;
      preFirst = v[i].first;
      preSecond = 0;
    }
    preSecond += v[i].second;
  }
  return (res + preSecond * pow_mod(preFirst % y, x, y) % y) % y;
}
int main(void) {
  cin >> n >> m >> seed >> vmax;
  for (long long i = 1; i <= n; i++) {
    a[i] = (rnd() % vmax) + 1;
  }
  build(1, n, 1);
  for (long long i = 1; i <= m; i++) {
    long long op = (rnd() % 4) + 1;
    long long l = (rnd() % n) + 1;
    long long r = (rnd() % n) + 1;
    if (l > r) {
      swap(l, r);
    }
    long long x, y;
    if (op == 3) {
      x = (rnd() % (r - l + 1)) + 1;
    } else {
      x = (rnd() % vmax) + 1;
    }
    if (op == 4) {
      y = (rnd() % vmax) + 1;
    }
    if (op == 1) {
      op1(l, r, 1, n, 1, x);
    } else if (op == 2) {
      op2(l, r, 1, n, 1, x);
    } else if (op == 3) {
      cout << op3(l, r, x) << endl;
    } else {
      cout << op4(l, r, x, y) << endl;
    }
  }
  return 0;
}
