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>
const long long mod = 1e9 + 7;
struct node {
  long long l, r;
  mutable long long v;
  node(long long l, long long r = -1, long long v = 0) : l(l), r(r), v(v) {}
  bool operator<(node x) const { return l < x.l; }
};
long long fast_mul(long long a, long long b, long long m) {
  long long d = ((long double)a / m * b + 1e-8);
  long long r = a * b - d * m;
  return r < 0 ? r + m : r;
}
long long fast_pow(long long a, long long b, long long p) {
  long long ret = 1;
  while (b) {
    if (b & 1) ret = (fast_mul(ret, a, p)) % p;
    a = (fast_mul(a, a, p)) % p;
    b >>= 1;
  }
  return ret;
}
struct ChthollyTree {
  std::set<node> s;
  std::set<node>::iterator split(long long mid) {
    std::set<node>::iterator it = s.lower_bound(node(mid));
    if (it != s.end() && it->l == mid) return it;
    --it;
    long long l = it->l, r = it->r, v = it->v;
    s.erase(it), s.insert(node(l, mid - 1, v));
    return s.insert(node(mid, r, v)).first;
  }
  void assign(long long l, long long r, long long v) {
    std::set<node>::iterator R = split(r + 1), L = split(l);
    s.erase(L, R), s.insert(node(l, r, v));
  }
  void add(long long l, long long r, long long val) {
    std::set<node>::iterator R = split(r + 1), L = split(l);
    while (L != R) L->v += val, ++L;
  }
  long long query_kth(long long l, long long r, long long x) {
    std::vector<std::pair<long long, long long>> vec;
    std::set<node>::iterator R = split(r + 1), L = split(l);
    while (L != R) vec.push_back(std::make_pair(L->v, (L->r - L->l + 1))), ++L;
    std::sort(vec.begin(), vec.end());
    for (long long i = 0; i < vec.size(); i++) {
      x -= vec[i].second;
      if (x <= 0) return vec[i].first;
    }
  }
  long long query_powx(long long l, long long r, long long x, long long y) {
    long long ans = 0;
    std::set<node>::iterator R = split(r + 1), L = split(l);
    while (L != R)
      ans = (ans + fast_pow(L->v, x, y) * ((L->r) - (L->l) + 1) % y) % y, ++L;
    return ans;
  }
} Ct;
long long n, m, seed, vmax;
long long rnd() {
  long long ret = seed;
  seed = (seed * 7ll + 13) % mod;
  return ret;
}
int main() {
  scanf("%lld%lld%lld%lld", &n, &m, &seed, &vmax);
  for (long long i = 1; i <= n; i++) {
    long long l = i, r = i, v = rnd() % vmax + 1;
    Ct.s.insert(node(l, r, v));
  }
  for (long long i = 1; i <= m; i++) {
    long long op = (rnd() % 4 + 1);
    long long l = (rnd() % n + 1), r = (rnd() % n) + 1;
    if (l > r) std::swap(l, r);
    if (op == 1) {
      long long x = (rnd() % vmax) + 1;
      Ct.add(l, r, x);
    } else if (op == 2) {
      long long x = (rnd() % vmax) + 1;
      Ct.assign(l, r, x);
    } else if (op == 3) {
      long long x = (rnd() % (r - l + 1)) + 1;
      printf("%llu\n", Ct.query_kth(l, r, x));
    } else {
      long long x = (rnd() % vmax) + 1, y = (rnd() % vmax) + 1;
      printf("%llu\n", Ct.query_powx(l, r, x, y));
    }
  }
  return 0;
}