Problem: One social network developer recently suggested a new algorithm of choosing ads for users.

There are n slots which advertisers can buy. It is possible to buy a segment of consecutive slots at once. The more slots you own, the bigger are the chances your ad will be shown to users.

Every time it is needed to choose ads to show, some segment of slots is picked by a secret algorithm. Then some advertisers are chosen. The only restriction is that it should be guaranteed for advertisers which own at least p% of slots composing this segment that their ad will be shown.

From the other side, users don't like ads. So it was decided to show no more than <image> ads at once. You are asked to develop a system to sell segments of slots and choose ads in accordance with the rules described above.

Input

The first line of the input contains three integers n, m and p (1 ≤ n, m ≤ 150 000, 20 ≤ p ≤ 100) — the number of slots, the number of queries to your system and threshold for which display of the ad is guaranteed.

Next line contains n integers ai (1 ≤ ai ≤ 150 000), where the i-th number means id of advertiser who currently owns the i-th slot.

Next m lines contain queries descriptions. Each description is of one of the following forms: 

  * 1 l r id (1 ≤ l ≤ r ≤ n, 1 ≤ id ≤ 150 000) — advertiser id bought all slots in a range from l to r inclusive; 
  * 2 l r (1 ≤ l ≤ r) — you need to choose advertisers for segment [l, r]. 

Output

For each query of the second type answer should be printed in a separate line. First integer of the answer should be the number of advertisements that will be shown <image>. Next cnt integers should be advertisers' ids. 

It is allowed to print one advertiser more than once, but each advertiser that owns at least <image> slots of the segment from l to r should be in your answer.

Example

Input

5 9 33
1 2 1 3 3
2 1 5
2 1 5
2 1 3
2 3 3
1 2 4 5
2 1 5
2 3 5
1 4 5 1
2 1 5


Output

3 1 2 3
2 1 3
2 2 1
3 1 1000 1000
1 5
2 5 3
2 1 5

Note

Samples demonstrate that you actually have quite a lot of freedom in choosing advertisers.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int nmax = 150042;
int n, q, p, arr[nmax];
struct info {
  int l, r;
  int lazy;
  pair<int, int> seen[10];
  int sz;
};
info tree[4 * nmax];
int keep;
bool cmp(pair<int, int> a, pair<int, int> b) { return a.second > b.second; }
info my_merge(info a, info b) {
  info ret;
  ret.l = a.l;
  ret.r = b.r;
  ret.lazy = 0;
  ret.sz = a.sz;
  for (int i = 0; i < a.sz; i++) ret.seen[i] = a.seen[i];
  for (int j = 0; j < b.sz; j++) {
    bool ok = 0;
    for (int i = 0; i < ret.sz; i++)
      if (ret.seen[i].first == b.seen[j].first) {
        ret.seen[i].second += b.seen[j].second;
        ok = 1;
        break;
      }
    if (ok == 0) {
      ret.seen[ret.sz] = b.seen[j];
      ret.sz++;
    }
  }
  sort(ret.seen, ret.seen + ret.sz, cmp);
  while (ret.sz && (ret.sz > keep || ret.seen[ret.sz - 1].second <= 0)) {
    int rem = ret.seen[ret.sz - 1].second;
    ret.sz--;
    for (int j = 0; j < ret.sz; j++)
      ret.seen[j].second = max(0, ret.seen[j].second - rem);
  }
  return ret;
}
void build(int node, int l, int r) {
  if (l == r) {
    tree[node].l = l;
    tree[node].r = r;
    tree[node].lazy = 0;
    tree[node].sz = 1;
    tree[node].seen[0] = {arr[l], 1};
    return;
  }
  int av = (l + r) / 2;
  build(node * 2, l, av);
  build(node * 2 + 1, av + 1, r);
  tree[node] = my_merge(tree[node * 2], tree[node * 2 + 1]);
}
void note(int node, int l, int r, int value) {
  tree[node].lazy = value;
  tree[node].seen[0] = {value, r - l + 1};
  tree[node].sz = 1;
}
void update(int node, int l, int r, int lq, int rq, int value) {
  if (l == lq && r == rq) {
    note(node, l, r, value);
    return;
  }
  int av = (l + r) / 2;
  if (tree[node].lazy) note(node * 2, l, av, tree[node].lazy);
  if (tree[node].lazy) note(node * 2 + 1, av + 1, r, tree[node].lazy);
  tree[node].lazy = 0;
  if (lq <= av) update(node * 2, l, av, lq, min(av, rq), value);
  if (av < rq) update(node * 2 + 1, av + 1, r, max(av + 1, lq), rq, value);
  tree[node] = my_merge(tree[node * 2], tree[node * 2 + 1]);
}
info query(int node, int l, int r, int lq, int rq) {
  if (l == lq && r == rq) return tree[node];
  int av = (l + r) / 2;
  if (tree[node].lazy) note(node * 2, l, av, tree[node].lazy);
  if (tree[node].lazy) note(node * 2 + 1, av + 1, r, tree[node].lazy);
  tree[node].lazy = 0;
  info ret;
  if (lq <= av && av + 1 <= rq)
    ret = my_merge(query(node * 2, l, av, lq, av),
                   query(node * 2 + 1, av + 1, r, av + 1, rq));
  else if (lq <= av)
    ret = query(node * 2, l, av, lq, rq);
  else
    ret = query(node * 2 + 1, av + 1, r, lq, rq);
  tree[node] = my_merge(tree[node * 2], tree[node * 2 + 1]);
  return ret;
}
int main() {
  scanf("%i%i%i", &n, &q, &p);
  for (int i = 1; i <= n; i++) scanf("%i", &arr[i]);
  keep = 100 / p;
  build(1, 1, n);
  int type, l, r, value;
  for (int i = 1; i <= q; i++) {
    scanf("%i%i%i", &type, &l, &r);
    if (type == 1) {
      scanf("%i", &value);
      update(1, 1, n, l, r, value);
    } else {
      info output = query(1, 1, n, l, r);
      printf("%i", output.sz);
      for (int k = 0; k < output.sz; k++) printf(" %i", output.seen[k].first);
      printf("\n");
    }
  }
  return 0;
}