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 N = 400010;
long long pw(long long a, long long b, long long mod) {
  long long res = 1;
  a %= mod;
  while (b) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return res;
}
struct ODT {
  int l, r;
  mutable long long v;
  ODT(int L, int R = -1, long long V = 0) { l = L, r = R, v = V; }
};
bool operator<(ODT A, ODT B) { return A.l < B.l; }
set<ODT> s;
int n, m;
long long a[N];
long long seed, vmax;
set<ODT>::iterator split(int pos) {
  set<ODT>::iterator it = s.lower_bound(ODT(pos)), num = it;
  num--;
  ODT IT = *it, now = *num;
  if (it != s.end() && IT.l == pos) return it;
  int L = now.l, R = now.r;
  long long V = now.v;
  s.erase(num);
  s.insert(ODT(L, pos - 1, V));
  return s.insert(ODT(pos, R, V)).first;
}
void add(int L, int R, long long V = 1) {
  set<ODT>::iterator itl = split(L), itr = split(R + 1);
  while (itl != itr) {
    (*itl).v += V;
    itl++;
  }
}
void assign(int L, int R, long long V) {
  set<ODT>::iterator itl = split(L), itr = split(R + 1);
  s.erase(itl, itr);
  s.insert(ODT(L, R, V));
}
long long _kth(int L, int R, long long K = 0) {
  vector<pair<long long, long long>> Q;
  set<ODT>::iterator itl = split(L), itr = split(R + 1);
  Q.clear();
  while (itl != itr) {
    ODT now = *itl;
    Q.push_back(make_pair(now.v, (long long)now.r - now.l + 1));
    itl++;
  }
  sort(Q.begin(), Q.end());
  for (vector<pair<long long, long long>>::iterator i = Q.begin(); i < Q.end();
       i++) {
    K -= (*i).second;
    if (K <= 0) return (*i).first;
  }
  return -1LL;
}
long long powsum(int L, int R, long long K, long long mod) {
  set<ODT>::iterator itl = split(L), itr = split(R + 1);
  long long res = 0;
  while (itl != itr) {
    ODT now = *itl;
    res = (res + (long long)(now.r - now.l + 1) * pw(now.v, K, mod)) % mod;
    itl++;
  }
  return res;
}
long long rnd() {
  long long ret = seed;
  seed = (seed * 7 + 13) % 1000000007;
  return ret;
}
int main() {
  scanf("%d%d%lld%lld", &n, &m, &seed, &vmax);
  for (int i = 1; i <= n; i++) {
    a[i] = (rnd() % vmax) + 1;
    s.insert(ODT(i, i, a[i]));
  }
  s.insert(ODT(n + 1, n + 1, 0));
  for (int i = 1; i <= m; i++) {
    int opt = (rnd() % 4) + 1;
    int l = (rnd() % n) + 1;
    int r = (rnd() % n) + 1;
    if (l > r) swap(l, r);
    int x = 0, y = 0;
    if (opt == 3)
      x = (rnd() % (r - l + 1)) + 1;
    else
      x = (rnd() % vmax) + 1;
    if (opt == 4) y = (rnd() % vmax) + 1;
    if (opt == 1) {
      add(l, r, (long long)x);
    } else if (opt == 2) {
      assign(l, r, (long long)x);
    } else if (opt == 3) {
      printf("%lld\n", _kth(l, r, (long long)x));
    } else {
      printf("%lld\n", powsum(l, r, (long long)x, (long long)y));
    }
  }
}