— 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
#include <bits/stdc++.h>
using namespace std;
using pii = pair<long long, long long>;
const long long INF = 1e18 + 7;
const long long N = 1e5 + 7;
const long long MOD = 1e9 + 7;
long long n, m, seed, v_max, i, j, k;
long long a[N];
long long op, l, r, x, y;
long long plusi(long long a, long long b, long long mo) {
  long long cur = (0LL + a + b) % mo;
  return cur;
}
long long multi(long long a, long long b, long long mo) {
  a %= mo, b %= mo;
  long long cur = (1LL * a * b) % mo;
  return cur;
}
long long power(long long base, long long pow, long long mo) {
  if (pow == 0LL) return 1LL;
  if (pow == 1LL) {
    base %= mo;
    return base;
  }
  long long cur = power(base, pow / 2, mo);
  cur = multi(cur, cur, mo);
  if (pow % 2) cur = multi(cur, base, mo);
  return cur;
}
long long rnd() {
  long long cur = seed;
  seed = ((seed * 7) + 13) % MOD;
  return cur;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n >> m >> seed >> v_max;
  for (i = 1; i <= n; i++) a[i] = rnd() % v_max + 1;
  queue<pii> prv, pq;
  for (i = 1; i <= n; i++) {
    pii u = {i, i};
    pq.push(u);
  }
  for (i = 0; i < m; i++) {
    op = rnd() % 4 + 1;
    l = rnd() % n + 1;
    r = rnd() % n + 1;
    if (l > r) swap(l, r);
    if (op == 3)
      x = rnd() % (r - l + 1) + 1;
    else
      x = rnd() % v_max + 1;
    if (op == 4) y = rnd() % v_max + 1;
    if (op == 1) {
      while (!pq.empty()) {
        pii cur = pq.front();
        pq.pop();
        long long q = cur.first;
        long long w = cur.second;
        if (q == l && w == r) a[q] += x;
        if (q == l && w < r) a[q] += x;
        if (q == l && w > r)
          prv.push({q, r}), a[r + 1] = a[q], a[q] += x, q = r + 1;
        if (q > l && w == r) a[q] += x;
        if (q > l && w > r && q <= r)
          prv.push({q, r}), a[r + 1] = a[q], a[q] += x, q = r + 1;
        if (q < l && w == r) prv.push({q, l - 1}), a[l] = a[q] + x, q = l;
        if (q < l && w < r && w >= l)
          prv.push({q, l - 1}), a[l] = a[q] + x, q = l;
        if (q > l && w < r) a[q] += x;
        if (q < l && w > r) {
          prv.push({q, l - 1});
          prv.push({r + 1, w});
          a[r + 1] = a[q];
          a[l] = a[q] + x;
          q = l;
          w = r;
        }
        prv.push({q, w});
      }
    }
    if (op == 2) {
      while (!pq.empty()) {
        pii cur = pq.front();
        pq.pop();
        long long q = cur.first;
        long long w = cur.second;
        if (q == l && w > r) prv.push({r + 1, w}), a[r + 1] = a[q];
        if (q < l && w == r) prv.push({q, l - 1});
        if (q < l && w > r) {
          prv.push({q, l - 1});
          prv.push({r + 1, w});
          a[r + 1] = a[q];
        }
        if (q < l && w < r && w >= l) prv.push({q, l - 1});
        if (q > l && w > r && q <= r) prv.push({r + 1, w}), a[r + 1] = a[q];
        if (w < l || q > r) prv.push({q, w});
      }
      prv.push({l, r});
      a[l] = x;
    }
    if (op == 3) {
      priority_queue<pii> ans;
      while (!pq.empty()) {
        pii cur = pq.front();
        pq.pop();
        long long q = cur.first;
        long long w = cur.second;
        if (q == l && w == r) ans.push({-a[q], r - l + 1});
        if (q == l && w < r) ans.push({-a[q], w - l + 1});
        if (q == l && w > r) ans.push({-a[q], r - l + 1});
        if (q > l && w == r) ans.push({-a[q], r - q + 1});
        if (q < l && w == r) ans.push({-a[q], r - l + 1});
        if (q > l && w > r && q <= r) ans.push({-a[q], r - q + 1});
        if (q > l && w < r) ans.push({-a[q], w - q + 1});
        if (q < l && w < r && w >= l) ans.push({-a[q], w - l + 1});
        if (q < l && w > r) ans.push({-a[q], r - l + 1});
        prv.push({q, w});
      }
      long long here = 0;
      long long prin = 1e18 + 7;
      while (here < x) {
        here += ans.top().second;
        prin = -ans.top().first;
        ans.pop();
      }
      cout << prin << "\n";
    }
    if (op == 4) {
      long long ans = 0;
      while (!pq.empty()) {
        pii cur = pq.front();
        pq.pop();
        long long q = cur.first;
        long long w = cur.second;
        if (q == l && w == r) ans = multi(r - l + 1, power(a[q], x, y), y);
        if (q == l && w < r)
          ans = plusi(ans, multi(w - q + 1, power(a[q], x, y), y), y);
        if (q == l && w > r) ans = multi(r - l + 1, power(a[q], x, y), y);
        if (q > l && w == r)
          ans = plusi(ans, multi(w - q + 1, power(a[q], x, y), y), y);
        if (q < l && w == r) ans = multi(r - l + 1, power(a[q], x, y), y);
        if (q < l && w < r && w >= l)
          ans = plusi(ans, multi(w - l + 1, power(a[q], x, y), y), y);
        if (q > l && w < r)
          ans = plusi(ans, multi(w - q + 1, power(a[q], x, y), y), y);
        if (q > l && w > r && q <= r)
          ans = plusi(ans, multi(r - q + 1, power(a[q], x, y), y), y);
        if (q < l && w > r) ans = multi(r - l + 1, power(a[q], x, y), y);
        prv.push({q, w});
      }
      cout << ans << "\n";
    }
    while (!prv.empty()) {
      pq.push(prv.front());
      prv.pop();
    }
  }
  return 0;
}
