Problem: — Willem...

— What's the matter?

— It seems that there's something wrong with Seniorious...

— I'll have a look...

<image>

Seniorious is made by linking special talismans in particular order.

After over 500 years, the carillon is now in bad condition, so Willem decides to examine it thoroughly.

Seniorious has n pieces of talisman. Willem puts them in a line, the i-th of which is an integer ai.

In order to maintain it, Willem needs to perform m operations.

There are four types of operations:

  * 1 l r x: For each i such that l ≤ i ≤ r, assign ai + x to ai.
  * 2 l r x: For each i such that l ≤ i ≤ r, assign x to ai.
  * 3 l r x: Print the x-th smallest number in the index range [l, r], i.e. the element at the x-th position if all the elements ai such that l ≤ i ≤ r are taken and sorted into an array of non-decreasing integers. It's guaranteed that 1 ≤ x ≤ r - l + 1.
  * 4 l r x y: Print the sum of the x-th power of ai such that l ≤ i ≤ r, modulo y, i.e. <image>.

Input

The only line contains four integers n, m, seed, vmax (1 ≤ n, m ≤ 105, 0 ≤ seed < 109 + 7, 1 ≤ vmax ≤ 109).

The initial values and operations are generated using following pseudo code:
    
    
      
    def rnd():  
      
        ret = seed  
        seed = (seed * 7 + 13) mod 1000000007  
        return ret  
      
    for i = 1 to n:  
      
        a[i] = (rnd() mod vmax) + 1  
      
    for i = 1 to m:  
      
        op = (rnd() mod 4) + 1  
        l = (rnd() mod n) + 1  
        r = (rnd() mod n) + 1  
      
        if (l > r):   
             swap(l, r)  
      
        if (op == 3):  
            x = (rnd() mod (r - l + 1)) + 1  
        else:  
            x = (rnd() mod vmax) + 1  
      
        if (op == 4):  
            y = (rnd() mod vmax) + 1  
      
    

Here op is the type of the operation mentioned in the legend.

Output

For each operation of types 3 or 4, output a line containing the answer.

Examples

Input

10 10 7 9


Output

2
1
0
3


Input

10 10 9 9


Output

1
1
3
3

Note

In the first example, the initial array is {8, 9, 7, 2, 3, 1, 5, 6, 4, 8}.

The operations are:

  * 2 6 7 9
  * 1 3 10 8
  * 4 4 6 2 4
  * 1 4 5 8
  * 2 1 7 1
  * 4 7 9 4 4
  * 1 2 7 9
  * 4 5 8 1 1
  * 2 5 7 5
  * 4 3 10 8 5

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int SIZ = 1e5 + 1007;
int N, M, VMax;
long long Seed;
int rnd() {
  int ret = Seed;
  Seed = (Seed * 7 + 13) % 1000000007;
  return ret;
}
struct seg {
  int l, r;
  long long val;
  friend bool operator<(const seg &a, const seg &b) { return a.l < b.l; }
};
bool cmp_val(const seg &a, const seg &b) { return a.val < b.val; }
set<seg> S;
int Seq[SIZ];
void init() {
  int prev = Seq[1], prep = 1, _ = N + 1;
  for (int i = 1; i <= _; i++) {
    if (Seq[i] != prev) {
      S.insert(seg{prep, i - 1, prev});
      prev = Seq[i];
      prep = i;
    }
  }
}
void q_add(int l, int r, int x) {
  set<seg>::iterator st = S.upper_bound(seg{l, 0, 0});
  --st;
  set<seg>::iterator nd = S.upper_bound(seg{r, 0, 0});
  vector<seg> buf;
  for (set<seg>::iterator i = st; i != nd; ++i) {
    if (i->l > r) break;
    buf.push_back(*i);
  }
  S.erase(st, nd);
  if (buf[0].l < l) {
    S.insert(seg{buf[0].l, l - 1, buf[0].val});
    buf[0].l = l;
  }
  int _ = buf.size() - 1;
  if (buf[_].r > r) {
    S.insert(seg{r + 1, buf[_].r, buf[_].val});
    buf[_].r = r;
  }
  for (seg &s : buf) {
    s.val += x;
    S.insert(s);
  }
}
void q_change(int l, int r, int x) {
  set<seg>::iterator st = S.upper_bound(seg{l, 0, 0});
  --st;
  set<seg>::iterator nd = S.upper_bound(seg{r, 0, 0});
  vector<seg> buf;
  for (set<seg>::iterator i = st; i != nd; ++i) {
    if (i->l > r) break;
    buf.push_back(*i);
  }
  S.erase(st, nd);
  if (buf[0].l < l && buf[0].val != x) {
    S.insert(seg{buf[0].l, l - 1, buf[0].val});
    buf[0].l = l;
  }
  int _ = buf.size() - 1;
  if (buf[_].r > r && buf[_].val != x) {
    S.insert(seg{r + 1, buf[_].r, buf[_].val});
    buf[_].r = r;
  }
  S.insert(seg{buf[0].l, buf[_].r, x});
}
void q_kth(int l, int r, int x) {
  set<seg>::iterator st = S.upper_bound(seg{l, 0, 0});
  --st;
  set<seg>::iterator nd = S.upper_bound(seg{r, 0, 0});
  vector<seg> buf;
  for (set<seg>::iterator i = st; i != nd; ++i) {
    if (i->l > r) break;
    buf.push_back(*i);
  }
  if (buf[0].l < l) {
    buf[0].l = l;
  }
  int _ = buf.size() - 1;
  if (buf[_].r > r) {
    buf[_].r = r;
  }
  sort(buf.begin(), buf.end(), cmp_val);
  long long cnt = 0;
  long long ans = -1;
  for (seg &s : buf) {
    cnt += (s.r - s.l + 1);
    if (cnt >= x) {
      ans = s.val;
      break;
    }
  }
  printf("%lld\n", ans);
}
long long qpow(long long a, long long b, long long mod) {
  long long ret = 1;
  a = a % mod;
  while (b) {
    if (b & 1) ret = (ret * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return ret;
}
void q_sum(int l, int r, int x, int y) {
  set<seg>::iterator st = S.upper_bound(seg{l, 0, 0});
  --st;
  set<seg>::iterator nd = S.upper_bound(seg{r, 0, 0});
  vector<seg> buf;
  for (set<seg>::iterator i = st; i != nd; ++i) {
    if (i->l > r) break;
    buf.push_back(*i);
  }
  if (buf[0].l < l) {
    buf[0].l = l;
  }
  int _ = buf.size() - 1;
  if (buf[_].r > r) {
    buf[_].r = r;
  }
  long long ans = 0;
  for (seg &s : buf) {
    ans = (ans + (s.r - s.l + 1) * qpow(s.val, x, y)) % y;
  }
  printf("%d\n", int(ans));
}
int main() {
  scanf("%d %d %lld %d", &N, &M, &Seed, &VMax);
  for (int i = 1; i <= N; i++) {
    Seq[i] = (rnd() % VMax) + 1;
  }
  init();
  for (int i = 1; i <= M; i++) {
    int op = (rnd() % 4) + 1;
    int l = (rnd() % N) + 1;
    int r = (rnd() % N) + 1;
    if (l > r) swap(l, r);
    int x = -1, y = -1;
    if (op == 3)
      x = (rnd() % (r - l + 1)) + 1;
    else
      x = (rnd() % VMax) + 1;
    if (op == 4) y = (rnd() % VMax) + 1;
    switch (op) {
      case 1:
        q_add(l, r, x);
        break;
      case 2:
        q_change(l, r, x);
        break;
      case 3:
        q_kth(l, r, x);
        break;
      case 4:
        q_sum(l, r, x, y);
        break;
    }
  }
}