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;
int n, m;
long long seed, vax;
long long Pow(long long a, long long b, long long mod) {
  if (!b) return 1LL % mod;
  long long r = Pow(a, b / 2, mod);
  r = (r * r) % mod;
  if (b & 1) r = (r * (a % mod)) % mod;
  return r;
}
long long pot(long long a, long long b, long long mod) {
  a %= mod;
  long long ret = 1;
  while (b) {
    if (b & 1) ret = (ret * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return ret % mod;
}
long long rnd() {
  long long ret = seed;
  seed = (seed * 7 + 13) % 1000000007;
  return ret;
}
struct interval {
  int l, r;
  long long val;
  interval() {}
  interval(int l, int r, long long val) : l(l), r(r), val(val) {}
  bool operator<(const interval& rhs) const {
    if (l != rhs.l) return l < rhs.l;
    return r < rhs.r;
  }
};
set<interval> seg;
vector<interval> cur;
void cut(int v) {
  auto it = seg.lower_bound({v, n + 5, -1});
  --it;
  if (it->r == v) return;
  auto temp = *it;
  seg.erase(it);
  seg.insert({temp.l, v, temp.val});
  seg.insert({v + 1, temp.r, temp.val});
}
void abi(int l, int r) {
  cut(l - 1);
  cut(r);
  cur.clear();
  for (auto it = seg.lower_bound({l, -1, -1}); it->l <= r; ++it)
    cur.push_back(*it);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m >> seed >> vax;
  seg.insert({0, 0, 0});
  seg.insert({n + 1, n + 1, 0});
  for (int i = 1; i <= n; i++) seg.insert({i, i, (rnd() % vax) + 1});
  for (int q = 0; q < m; q++) {
    int op, l, r, x, y;
    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() % vax + 1;
    if (op == 4) y = rnd() % vax + 1;
    abi(l, r);
    if (op == 1) {
      for (int i = 0; i < ((int)(cur).size()); i++) {
        seg.erase(cur[i]);
        seg.insert({cur[i].l, cur[i].r, cur[i].val + x});
      }
    } else if (op == 2) {
      for (int i = 0; i < ((int)(cur).size()); i++) {
        seg.erase(cur[i]);
      }
      seg.insert({l, r, x});
    } else if (op == 3) {
      sort(cur.begin(), cur.end(),
           [](interval lhs, interval rhs) { return lhs.val < rhs.val; });
      for (int i = 0; i < ((int)(cur).size()); i++) {
        int len = cur[i].r - cur[i].l + 1;
        long long val = cur[i].val;
        if (x <= len) {
          cout << val << endl;
          break;
        }
        x -= len;
      }
    } else {
      long long ret = 0;
      for (int i = 0; i < ((int)(cur).size()); i++) {
        int len = cur[i].r - cur[i].l + 1;
        long long v = cur[i].val;
        ret += 1LL * len * Pow(v, x, y);
        ret %= y;
      }
      cout << ret << endl;
    }
  }
  return 0;
}