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;
#pragma GCC target("avx2")
#pragma GCC optimization("O2")
#pragma GCC optimization("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
long long n, m, seed, vmax;
long long rnd() {
  long long ret = seed;
  seed = (seed * 7 + 13) % 1000000007;
  return ret;
}
long long BigMod(long long b, long long p, long long m) {
  long long ret = 1;
  while (p > 0) {
    if (p % 2 == 1) ret = (ret * b) % m;
    p = p >> 1;
    b = (b * b) % m;
  }
  return ret;
}
const int N = 100005;
long long ara[N];
set<pair<pair<long long, long long>, long long>> st;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(nullptr);
  cin >> n >> m >> seed >> vmax;
  for (int i = 1; i <= n; i++) ara[i] = (rnd() % vmax) + 1;
  for (int i = 1; i <= n; i++) {
    int to = i;
    for (int j = i; j <= n; j++) {
      if (ara[j] == ara[i])
        to = j;
      else
        break;
    }
    st.insert(make_pair(make_pair(to, i), ara[i]));
    i = to;
  }
  for (int timer = 1; timer <= m; timer++) {
    long long op = rnd() % 4 + 1;
    long long l = rnd() % n + 1;
    long long r = rnd() % n + 1;
    if (l > r) swap(l, r);
    long long x, y;
    if (op == 3)
      x = (rnd() % (r - l + 1)) + 1;
    else
      x = (rnd() % vmax) + 1;
    if (op == 4) y = (rnd() % vmax) + 1;
    if (op == 1) {
      auto it = st.lower_bound(make_pair(make_pair(l, 0), 0));
      vector<pair<pair<long long, long long>, long long>> vec;
      while (it != st.end()) {
        if (it->first.second > r) break;
        vec.push_back(*it);
        it++;
      }
      for (int i = 0; i < vec.size(); i++) {
        st.erase(vec[i]);
      }
      if (vec.size() == 1) {
        long long L = vec[0].first.second;
        long long R = vec[0].first.first;
        if (L <= l - 1)
          st.insert(make_pair(make_pair(l - 1, L), vec[0].second));
        st.insert(make_pair(make_pair(r, l), vec[0].second + x));
        if (r + 1 <= R)
          st.insert(make_pair(make_pair(R, r + 1), vec[0].second));
      } else {
        if (1 == 1) {
          long long L = vec[0].first.second;
          long long R = vec[0].first.first;
          if (L <= l - 1)
            st.insert(make_pair(make_pair(l - 1, L), vec[0].second));
          st.insert(make_pair(make_pair(R, l), vec[0].second + x));
        }
        if (1 == 1) {
          long long L = vec.back().first.second;
          long long R = vec.back().first.first;
          if (r + 1 <= R)
            st.insert(make_pair(make_pair(R, r + 1), vec.back().second));
          st.insert(make_pair(make_pair(r, L), vec.back().second + x));
        }
        for (int i = 1; i + 1 < vec.size(); i++) {
          vec[i].second += x;
          st.insert(vec[i]);
        }
      }
    } else if (op == 2) {
      auto it = st.lower_bound(make_pair(make_pair(l, 0), 0));
      vector<pair<pair<long long, long long>, long long>> vec;
      while (it != st.end()) {
        if (it->first.second > r) break;
        vec.push_back(*it);
        it++;
      }
      for (int i = 0; i < vec.size(); i++) {
        st.erase(vec[i]);
      }
      if (vec.size() == 1) {
        long long L = vec[0].first.second;
        long long R = vec[0].first.first;
        if (L <= l - 1)
          st.insert(make_pair(make_pair(l - 1, L), vec[0].second));
        st.insert(make_pair(make_pair(r, l), x));
        if (r + 1 <= R)
          st.insert(make_pair(make_pair(R, r + 1), vec[0].second));
      } else {
        if (1 == 1) {
          long long L = vec[0].first.second;
          long long R = vec[0].first.first;
          R = min(R, l - 1);
          if (L <= R) st.insert(make_pair(make_pair(R, L), vec[0].second));
          st.insert(make_pair(make_pair(R, l), vec[0].second));
        }
        if (1 == 1) {
          long long L = vec.back().first.second;
          long long R = vec.back().first.first;
          L = max(L, r + 1);
          if (L <= R) st.insert(make_pair(make_pair(R, L), vec.back().second));
          st.insert(make_pair(make_pair(r, L), vec.back().second));
        }
        st.insert(make_pair(make_pair(r, l), x));
      }
    } else if (op == 4) {
      auto it = st.lower_bound(make_pair(make_pair(l, 0), 0));
      vector<pair<pair<long long, long long>, long long>> vec;
      while (it != st.end()) {
        if (it->first.second > r) break;
        vec.push_back(*it);
        it++;
      }
      vector<pair<long long, long long>> cnt;
      if (vec.size() == 1) {
        cnt.push_back(make_pair(vec[0].second, r - l + 1));
      } else {
        if (1 == 1) {
          long long L = vec[0].first.second;
          long long R = vec[0].first.first;
          if (l <= R) cnt.push_back(make_pair(vec[0].second, R - l + 1));
        }
        if (1 == 1) {
          long long L = vec.back().first.second;
          long long R = vec.back().first.first;
          if (L <= r) cnt.push_back(make_pair(vec.back().second, r - L + 1));
        }
        for (int i = 1; i + 1 < vec.size(); i++) {
          cnt.push_back(make_pair(
              vec[i].second, vec[i].first.first - vec[i].first.second + 1));
        }
      }
      long long ans = 0;
      for (int i = 0; i < cnt.size(); i++) {
        long long Count = cnt[i].second;
        ans = (ans + BigMod(cnt[i].first % y, x, y) * Count) % y;
      }
      cout << ans << "\n";
    } else {
      auto it = st.lower_bound(make_pair(make_pair(l, 0), 0));
      vector<pair<pair<long long, long long>, long long>> vec;
      while (it != st.end()) {
        if (it->first.second > r) break;
        vec.push_back(*it);
        it++;
      }
      vector<pair<long long, long long>> cnt;
      if (vec.size() == 1) {
        cnt.push_back(make_pair(vec[0].second, r - l + 1));
      } else {
        if (1 == 1) {
          long long L = vec[0].first.second;
          long long R = vec[0].first.first;
          if (l <= R) cnt.push_back(make_pair(vec[0].second, R - l + 1));
        }
        if (1 == 1) {
          long long L = vec.back().first.second;
          long long R = vec.back().first.first;
          if (L <= r) cnt.push_back(make_pair(vec.back().second, r - L + 1));
        }
        for (int i = 1; i + 1 < vec.size(); i++) {
          cnt.push_back(make_pair(
              vec[i].second, vec[i].first.first - vec[i].first.second + 1));
        }
      }
      sort(cnt.begin(), cnt.end());
      int got = 0;
      for (int i = 0; i < cnt.size(); i++) {
        got += cnt[i].second;
        if (got >= x) {
          cout << cnt[i].first << "\n";
          break;
        }
      }
    }
  }
}