#include <bits/stdc++.h>
using namespace std;
inline char gc() {
  static char buf[100000], *p1 = buf, *p2 = buf;
  return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
             ? EOF
             : *p1++;
}
inline int read() {
  int x = 0;
  char ch = getchar();
  bool positive = 1;
  for (; !isdigit(ch); ch = getchar())
    if (ch == '-') positive = 0;
  for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - '0';
  return positive ? x : -x;
}
inline void write(int x) {
  if (x < 0) x = -x, putchar('-');
  if (x > 9) write(x / 10);
  putchar(x % 10 + '0');
}
inline void writeln(int x) {
  write(x);
  puts("");
}
struct Tree {
  int l, r, lazy, num[5], sum[5];
} st[150005 * 4];
int n, m, p, l, r, k, q, opt, a[150005];
inline Tree up(Tree ls, Tree rs) {
  Tree ans;
  ans.l = ls.l;
  ans.r = rs.r;
  ans.lazy = 0;
  for (int i = 0; i < 5; i++) {
    ans.num[i] = ls.num[i];
    ans.sum[i] = ls.sum[i];
  }
  for (int i = 0; i < q; i++) {
    if (!rs.sum[i]) continue;
    bool flag = false;
    for (int j = 0; j < q; j++) {
      if (rs.num[i] == ans.num[j]) {
        ans.sum[j] += rs.sum[i];
        flag = true;
        break;
      }
    }
    if (!flag) {
      for (int j = 0; j < q; j++) {
        if (!ans.sum[j]) {
          ans.num[j] = rs.num[i];
          ans.sum[j] = rs.sum[i];
          flag = true;
          break;
        }
      }
    }
    if (!flag) {
      int now = -1;
      for (int j = 0; j < q; j++) {
        if (now == -1 || ans.sum[j] < ans.sum[now]) {
          now = j;
        }
      }
      if (ans.sum[now] >= rs.sum[i]) {
        for (int j = 0; j < q; j++) ans.sum[j] -= rs.sum[i];
      } else {
        int num = ans.sum[now];
        for (int j = 0; j < q; j++) ans.sum[j] -= num;
        ans.num[now] = rs.num[i];
        ans.sum[now] = rs.sum[i] - num;
      }
    }
  }
  return ans;
}
inline void down(int node) {
  if (!st[node].lazy) return;
  st[node << 1].lazy = st[node << 1 | 1].lazy = st[node].lazy;
  for (int j = 0; j < q; j++)
    st[node << 1].sum[j] = st[node << 1 | 1].sum[j] = 0;
  st[node << 1].num[0] = st[node << 1 | 1].num[0] = st[node].lazy;
  st[node << 1].sum[0] = st[node << 1].r - st[node << 1].l + 1;
  st[node << 1 | 1].sum[0] = st[node << 1 | 1].r - st[node << 1 | 1].l + 1;
  st[node].lazy = 0;
  return;
}
inline void build(int node, int l, int r) {
  st[node].l = l;
  st[node].r = r;
  if (l == r) {
    st[node].num[0] = a[l];
    st[node].sum[0] = 1;
    return;
  }
  int mid = (l + r) >> 1;
  build(node << 1, l, mid);
  build(node << 1 | 1, mid + 1, r);
  st[node] = up(st[node << 1], st[node << 1 | 1]);
  return;
}
inline void change(int node, int l, int r, int k) {
  if (st[node].l > r || st[node].r < l) return;
  if (st[node].l >= l && st[node].r <= r) {
    st[node].lazy = k;
    for (int j = 0; j < q; j++) st[node].sum[j] = 0;
    st[node].num[0] = k;
    st[node].sum[0] = st[node].r - st[node].l + 1;
    return;
  }
  down(node);
  change(node << 1, l, r, k);
  change(node << 1 | 1, l, r, k);
  st[node] = up(st[node << 1], st[node << 1 | 1]);
  return;
}
inline Tree query(int node, int l, int r) {
  if (st[node].l >= l && st[node].r <= r) {
    return st[node];
  }
  int mid = (st[node].l + st[node].r) >> 1;
  down(node);
  if (r <= mid) return query(node << 1, l, r);
  if (l > mid) return query(node << 1 | 1, l, r);
  Tree ans = up(query(node << 1, l, r), query(node << 1 | 1, l, r));
  return ans;
}
int main() {
  n = read();
  m = read();
  p = read();
  q = 100 / p;
  for (int i = 1; i <= n; i++) a[i] = read();
  build(1, 1, n);
  for (int i = 1; i <= m; i++) {
    opt = read();
    if (opt == 1) {
      l = read();
      r = read();
      k = read();
      change(1, l, r, k);
    } else {
      l = read();
      r = read();
      Tree now = query(1, l, r);
      write(q);
      putchar(' ');
      for (int i = 0; i < q; i++) {
        write(now.num[i]);
        putchar(' ');
      }
      puts("");
    }
  }
  return 0;
}
