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;
typedef struct {
  int op, l, r, x, y;
} query;
int n, m, seed, vmax, a[100000];
query qs[100000];
int rnd() {
  int ret = seed;
  seed = (1LL * seed * 7LL + 13LL) % 1000000007LL;
  return ret;
}
long long get_num(map<int, long long>& mp, int i) {
  auto it = mp.lower_bound(i);
  if (it == mp.end() || it->first > i) it--;
  return it->second;
}
long long pow(long long a, int b, int mod) {
  if (b == 0) return 1LL;
  if (b == 1) return a % mod;
  long long c = pow(a, b / 2, mod) % mod;
  if (b & 1) return (((c * c) % mod) * (a % mod)) % mod;
  return (c * c) % mod;
}
void debug_range(map<int, long long>& mp) {
  for (auto i = mp.begin(); i != mp.end(); i++)
    printf("(%d %lld) ", i->first, i->second);
  printf("\n");
}
int main() {
  scanf("%d%d%d%d", &n, &m, &seed, &vmax);
  for (int i = 0; i < n; i++) a[i] = (rnd() % vmax) + 1;
  for (int i = 0; i < m; i++) {
    qs[i].op = (rnd() % 4) + 1;
    qs[i].l = (rnd() % n) + 1 - 1;
    qs[i].r = (rnd() % n) + 1 - 1;
    if (qs[i].l > qs[i].r) swap(qs[i].l, qs[i].r);
    if (qs[i].op == 3)
      qs[i].x = (rnd() % (qs[i].r - qs[i].l + 1)) + 1;
    else
      qs[i].x = (rnd() % vmax) + 1;
    if (qs[i].op == 4) qs[i].y = (rnd() % vmax) + 1;
  }
  map<int, long long> mp;
  mp[0] = a[0];
  for (int i = 1; i < n; i++)
    if (a[i] != a[i - 1]) mp[i] = a[i];
  for (int i = 0; i < m; i++) {
    if (qs[i].op == 1) {
      long long tmp = get_num(mp, qs[i].r + 1);
      mp[qs[i].r + 1] = tmp;
      tmp = qs[i].x + get_num(mp, qs[i].l);
      mp[qs[i].l] = tmp;
      for (auto it = mp.lower_bound(qs[i].l + 1);
           it != mp.end() && it->first <= qs[i].r; it++)
        it->second += qs[i].x;
    } else if (qs[i].op == 2) {
      long long tmp = get_num(mp, qs[i].r + 1);
      mp[qs[i].r + 1] = tmp;
      vector<int> era;
      for (auto it = mp.lower_bound(qs[i].l);
           it != mp.end() && it->first <= qs[i].r; it++)
        era.push_back(it->first);
      for (int x : era) mp.erase(x);
      mp[qs[i].l] = qs[i].x;
    } else if (qs[i].op == 3) {
      map<long long, int> smp;
      int r = mp.lower_bound(qs[i].l) != mp.end()
                  ? min(qs[i].r + 1, mp.lower_bound(qs[i].l)->first)
                  : qs[i].r + 1;
      smp[get_num(mp, qs[i].l)] = r - qs[i].l;
      for (auto it = mp.lower_bound(qs[i].l);
           it != mp.end() && it->first <= qs[i].r; it++) {
        auto it2 = it;
        it2++;
        int r = it2 != mp.end() ? min(it2->first, qs[i].r + 1) : qs[i].r + 1;
        smp[it->second] += r - it->first;
      }
      for (auto it = smp.begin(); it != smp.end(); it++) {
        if (it->second >= qs[i].x) {
          printf("%lld\n", it->first);
          break;
        }
        qs[i].x -= it->second;
      }
    } else {
      int r = mp.lower_bound(qs[i].l) != mp.end()
                  ? min(qs[i].r + 1, mp.lower_bound(qs[i].l)->first)
                  : qs[i].r + 1;
      long long sum = (pow(get_num(mp, qs[i].l), qs[i].x, qs[i].y) *
                       ((r - qs[i].l) % qs[i].y)) %
                      qs[i].y;
      for (auto it = mp.lower_bound(qs[i].l);
           it != mp.end() && it->first <= qs[i].r; it++) {
        auto it2 = it;
        it2++;
        int r = it2 != mp.end() ? min(it2->first, qs[i].r + 1) : qs[i].r + 1;
        sum = (sum + (pow(it->second, qs[i].x, qs[i].y) * (r - it->first)) %
                         qs[i].y) %
              qs[i].y;
      }
      printf("%lld\n", sum % qs[i].y);
    }
  }
  return 0;
}