#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
inline long long read() {
  long long x = 0, f = 1;
  char c = getchar();
  for (; !isdigit(c); c = getchar())
    if (c == '-') f = -1;
  for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
  return x * f;
}
inline void write(long long x) {
  if (x < 0) x = -x, putchar('-');
  if (x >= 10) write(x / 10);
  putchar(x % 10 + '0');
}
inline void writeln(long long x) {
  write(x);
  putchar('\n');
}
inline void wri(long long x) {
  write(x);
  putchar(' ');
}
const int maxn = 6e5 + 233;
int n, p, Q;
struct node {
  int n;
  int a[5], b[5];
  void fill(int x, int y) {
    n = 1;
    a[0] = x;
    b[0] = y;
  }
} T[maxn << 2];
node operator+(node a, node b) {
  node c = a;
  for (register int i = (0); i < int(b.n); ++i) {
    int fl = 0;
    for (register int j = (0); j < int(c.n); ++j)
      if (c.a[j] == b.a[i]) {
        c.b[j] += b.b[i];
        fl = 1;
        break;
      }
    if (fl) continue;
    if (c.n < p) {
      c.a[c.n] = b.a[i];
      c.b[c.n] = b.b[i];
      c.n++;
      continue;
    }
    int k = 0;
    for (register int j = (1); j < int(c.n); ++j)
      if (c.b[j] < c.b[k]) k = j;
    if (b.b[i] < c.b[k]) {
      for (register int j = (0); j < int(c.n); ++j) c.b[j] -= b.b[i];
    } else {
      int tmp = c.b[k];
      c.a[k] = b.a[i];
      c.b[k] = b.b[i];
      for (register int j = (0); j < int(c.n); ++j) c.b[j] -= tmp;
    }
  }
  return c;
}
int tag[maxn << 2];
void pushdown(int o, int l, int r) {
  if (!tag[o]) return;
  T[(o << 1)].fill(tag[o], ((l + r) >> 1) - l + 1);
  T[(o << 1 | 1)].fill(tag[o], r - ((l + r) >> 1));
  tag[(o << 1)] = tag[(o << 1 | 1)] = tag[o];
  tag[o] = 0;
}
void modify(int o, int l, int r, int x, int y, int v) {
  if (l == x && r == y) {
    T[o].fill(v, r - l + 1);
    tag[o] = v;
    return;
  }
  pushdown(o, l, r);
  if (y <= ((l + r) >> 1))
    modify((o << 1), l, ((l + r) >> 1), x, y, v);
  else if (((l + r) >> 1) < x)
    modify((o << 1 | 1), ((l + r) >> 1) + 1, r, x, y, v);
  else
    modify((o << 1), l, ((l + r) >> 1), x, ((l + r) >> 1), v),
        modify((o << 1 | 1), ((l + r) >> 1) + 1, r, ((l + r) >> 1) + 1, y, v);
  T[o] = T[(o << 1)] + T[(o << 1 | 1)];
}
node query(int o, int l, int r, int x, int y) {
  if (l == x && r == y) return T[o];
  pushdown(o, l, r);
  if (y <= ((l + r) >> 1))
    return query((o << 1), l, ((l + r) >> 1), x, y);
  else if (((l + r) >> 1) < x)
    return query((o << 1 | 1), ((l + r) >> 1) + 1, r, x, y);
  else
    return query((o << 1), l, ((l + r) >> 1), x, ((l + r) >> 1)) +
           query((o << 1 | 1), ((l + r) >> 1) + 1, r, ((l + r) >> 1) + 1, y);
}
void build(int o, int l, int r) {
  tag[o] = 0;
  if (l == r) {
    T[o].fill(read(), 1);
    return;
  }
  build((o << 1), l, ((l + r) >> 1));
  build((o << 1 | 1), ((l + r) >> 1) + 1, r);
  T[o] = T[(o << 1)] + T[(o << 1 | 1)];
}
int main() {
  n = read(), Q = read(), p = 100 / read();
  build(1, 1, n);
  while (Q--) {
    int opt = read(), x = read(), y = read();
    if (opt == 1)
      modify(1, 1, n, x, y, read());
    else {
      node ans = query(1, 1, n, x, y);
      int t = min(p, ans.n);
      wri(t);
      for (register int i = (0); i < int(t); ++i) wri(ans.a[i]);
      puts("");
    }
  }
  return 0;
}
