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;
unsigned long long int N, M;
unsigned long long int seed, vmax;
unsigned long long int rnd() {
  unsigned long long int ret = seed;
  seed = (seed * 7 + 13) % 1000000007;
  return ret;
}
map<unsigned long long int, unsigned long long int> GetIntervals(
    const vector<unsigned long long int>& vtr) {
  map<unsigned long long int, unsigned long long int> ret;
  ret.insert(pair<unsigned long long int, unsigned long long int>(0, vtr[0]));
  for (unsigned long long int i = 1; i < vtr.size(); ++i)
    if (vtr[i] != (--ret.end())->second)
      ret.insert(
          --ret.end(),
          pair<unsigned long long int, unsigned long long int>(i, vtr[i]));
  return ret;
}
void CheckMap(
    map<unsigned long long int, unsigned long long int>& intervals,
    map<unsigned long long int, unsigned long long int>::iterator it) {
  if (it != intervals.begin()) {
    map<unsigned long long int, unsigned long long int>::iterator it_prev = it;
    --it_prev;
    if (it_prev->second == it->second) {
      intervals.erase(it);
      it = it_prev;
    }
  }
  map<unsigned long long int, unsigned long long int>::iterator it_next = it;
  ++it_next;
  if (it_next != intervals.end()) {
    if (it_next->second == it->second) {
      intervals.erase(it_next);
    }
  }
}
void ExecuteOp1(map<unsigned long long int, unsigned long long int>& intervals,
                const unsigned long long int& left,
                const unsigned long long int& right,
                const unsigned long long int& x) {
  map<unsigned long long int, unsigned long long int>::iterator it_After_right =
      intervals.upper_bound(right);
  map<unsigned long long int, unsigned long long int>::iterator it_right;
  map<unsigned long long int, unsigned long long int>::iterator
      it_BeforeEqual_right = it_After_right;
  --it_BeforeEqual_right;
  it_right = intervals.insert(
      it_BeforeEqual_right,
      pair<unsigned long long int, unsigned long long int>(right, 0));
  it_right->second = it_BeforeEqual_right->second;
  map<unsigned long long int, unsigned long long int>::iterator it_After_left =
      intervals.upper_bound(left);
  map<unsigned long long int, unsigned long long int>::iterator
      it_BeforeEqual_left = it_After_left;
  --it_BeforeEqual_left;
  map<unsigned long long int, unsigned long long int>::iterator it_left =
      intervals.insert(
          it_BeforeEqual_left,
          pair<unsigned long long int, unsigned long long int>(left, 0));
  it_left->second = it_BeforeEqual_left->second + x;
  map<unsigned long long int, unsigned long long int>::iterator it = it_left;
  ++it;
  while (it->first < right) (it++)->second += x;
  CheckMap(intervals, it_right);
  CheckMap(intervals, it_left);
}
void ExecuteOp2(map<unsigned long long int, unsigned long long int>& intervals,
                const unsigned long long int& left,
                const unsigned long long int& right,
                const unsigned long long int& x) {
  map<unsigned long long int, unsigned long long int>::iterator it_After_right =
      intervals.upper_bound(right);
  map<unsigned long long int, unsigned long long int>::iterator
      it_BeforeEqual_right = it_After_right;
  --it_BeforeEqual_right;
  map<unsigned long long int, unsigned long long int>::iterator it_right =
      intervals.insert(
          it_BeforeEqual_right,
          pair<unsigned long long int, unsigned long long int>(right, 0));
  it_right->second = it_BeforeEqual_right->second;
  map<unsigned long long int, unsigned long long int>::iterator it_left =
      intervals
          .insert(pair<unsigned long long int, unsigned long long int>(left, 0))
          .first;
  it_left->second = x;
  map<unsigned long long int, unsigned long long int>::iterator it = it_left;
  ++it;
  while (it->first < right) intervals.erase(it++);
  CheckMap(intervals, it_right);
  CheckMap(intervals, it_left);
}
unsigned long long int ExecuteOp3(
    const map<unsigned long long int, unsigned long long int>& intervals,
    const unsigned long long int& left, const unsigned long long int& right,
    unsigned long long int x) {
  multimap<unsigned long long int, unsigned long long int> ordered;
  map<unsigned long long int, unsigned long long int>::const_iterator
      it_After_left = intervals.upper_bound(left);
  map<unsigned long long int, unsigned long long int>::const_iterator
      it_BeforeEqual_left = it_After_left;
  --it_BeforeEqual_left;
  if (it_After_left->first - left != 0)
    ordered.insert(pair<unsigned long long int, unsigned long long int>(
        it_BeforeEqual_left->second, it_After_left->first - left));
  map<unsigned long long int, unsigned long long int>::const_iterator
      it_After_right = intervals.upper_bound(right);
  map<unsigned long long int, unsigned long long int>::const_iterator
      it_BeforeEqual_right = it_After_right;
  --it_BeforeEqual_right;
  if (right - it_BeforeEqual_right->first != 0)
    ordered.insert(pair<unsigned long long int, unsigned long long int>(
        it_BeforeEqual_right->second, right - it_BeforeEqual_right->first));
  map<unsigned long long int, unsigned long long int>::const_iterator it =
      it_After_left;
  map<unsigned long long int, unsigned long long int>::const_iterator it_ = it;
  ++it_;
  while (it->first < it_BeforeEqual_right->first) {
    ordered.insert(pair<unsigned long long int, unsigned long long int>(
        it->second, it_->first - it->first));
    ++it;
    ++it_;
  }
  multimap<unsigned long long int, unsigned long long int>::iterator
      it_ordered = ordered.begin();
  while (it_ordered != ordered.end()) {
    if (x <= it_ordered->second)
      return it_ordered->first;
    else
      x -= it_ordered->second;
    ++it_ordered;
  }
  return (--ordered.end())->first;
}
unsigned long long int power(const unsigned long long int& base,
                             unsigned long long int exp,
                             const unsigned long long int& mod) {
  deque<pair<unsigned long long int, unsigned long long int> > powers;
  powers.push_back(
      pair<unsigned long long int, unsigned long long int>(base % mod, 1));
  unsigned long long int p = 2;
  while (p <= exp) {
    powers.push_front(pair<unsigned long long int, unsigned long long int>(
        (powers.front().first * powers.front().first) % mod, p));
    p *= 2;
  }
  unsigned long long int ret = 1;
  while (exp > 0) {
    if (exp >= powers.front().second) {
      ret *= powers.front().first;
      ret %= mod;
      exp -= powers.front().second;
    }
    powers.pop_front();
  }
  return ret;
}
unsigned long long int ExecuteOp4(
    const map<unsigned long long int, unsigned long long int>& intervals,
    const unsigned long long int& left, const unsigned long long int& right,
    const unsigned long long int& x, const unsigned long long int& y) {
  deque<pair<unsigned long long int, unsigned long long int> > dqe;
  map<unsigned long long int, unsigned long long int>::const_iterator
      it_After_left = intervals.upper_bound(left);
  map<unsigned long long int, unsigned long long int>::const_iterator
      it_BeforeEqual_left = it_After_left;
  --it_BeforeEqual_left;
  map<unsigned long long int, unsigned long long int>::const_iterator
      it_After_right = intervals.upper_bound(right);
  map<unsigned long long int, unsigned long long int>::const_iterator
      it_BeforeEqual_right = it_After_right;
  --it_BeforeEqual_right;
  if (it_BeforeEqual_left != it_BeforeEqual_right) {
    if (it_After_left->first - left != 0)
      dqe.push_back(pair<unsigned long long int, unsigned long long int>(
          it_BeforeEqual_left->second, it_After_left->first - left));
    if (right - it_BeforeEqual_right->first != 0)
      dqe.push_back(pair<unsigned long long int, unsigned long long int>(
          it_BeforeEqual_right->second, right - it_BeforeEqual_right->first));
  } else {
    dqe.push_back(pair<unsigned long long int, unsigned long long int>(
        it_BeforeEqual_left->second, right - left));
  }
  map<unsigned long long int, unsigned long long int>::const_iterator it =
      it_After_left;
  map<unsigned long long int, unsigned long long int>::const_iterator it_ = it;
  ++it_;
  while (it->first < it_BeforeEqual_right->first) {
    dqe.push_back(pair<unsigned long long int, unsigned long long int>(
        it->second, it_->first - it->first));
    ++it;
    ++it_;
  }
  unsigned long long int ret = 0;
  while (dqe.size() != 0) {
    const pair<unsigned long long int, unsigned long long int>& curr =
        dqe.front();
    ret += (power(curr.first, x, y) * (curr.second % y)) % y;
    ret %= y;
    dqe.pop_front();
  }
  return ret;
}
int main() {
  cin >> N >> M >> seed >> vmax;
  vector<unsigned long long int> a(N);
  for (unsigned long long int i = 0; i < N; ++i) a[i] = (rnd() % vmax) + 1;
  map<unsigned long long int, unsigned long long int> intervals =
      GetIntervals(a);
  unsigned long long int op;
  unsigned long long int l, r;
  unsigned long long int x, y;
  unsigned long long int index = 0;
  for (unsigned long long int 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() % vmax) + 1;
    if (op == 4) y = (rnd() % vmax) + 1;
    switch (op) {
      case 1:
        ExecuteOp1(intervals, l - 1, r, x);
        break;
      case 2:
        ExecuteOp2(intervals, l - 1, r, x);
        break;
      case 3:
        cout << ExecuteOp3(intervals, l - 1, r, x) << endl;
        ++index;
        break;
      case 4:
        cout << ExecuteOp4(intervals, l - 1, r, x, y) << endl;
        ++index;
        break;
      default:
        break;
    }
  }
  return 0;
}