#include <bits/stdc++.h>
using namespace std;
const int N = 1.5e5 + 10;
inline int read() {
  register int x = 0, f = 0;
  register char c = getchar();
  while (c < '0' || c > '9') f |= c == '-', c = getchar();
  while (c >= '0' && c <= '9') x = (x << 3) + (x << 1) + c - '0', c = getchar();
  return f ? -x : x;
}
int n, m, p;
struct node {
  int siz, tag, a[6], b[6];
  node() {
    memset(a, 0, sizeof a);
    memset(b, 0, sizeof b);
    siz = tag = 0;
  }
  inline node operator=(const node &o) {
    siz = o.siz;
    tag = 0;
    memcpy(a, o.a, sizeof a);
    memcpy(b, o.b, sizeof b);
    return *this;
  }
  node operator+(const node &A) const {
    node res = A;
    for (int i = 1; i <= siz; ++i) {
      int flag = 0;
      for (int j = 1; j <= res.siz; ++j)
        if (a[i] == res.a[j]) {
          res.b[j] += b[i];
          flag = 1;
          break;
        }
      if (flag) continue;
      if (res.siz < p) {
        res.siz++;
        res.a[res.siz] = a[i];
        res.b[res.siz] = b[i];
        continue;
      }
      int k = 1;
      for (int j = 2; j <= res.siz; ++j)
        if (res.b[k] > res.b[j]) k = j;
      if (b[i] < res.b[k])
        for (int j = 1; j <= res.siz; ++j) res.b[j] -= b[i];
      else {
        int tmp = res.b[k];
        res.a[k] = a[i];
        res.b[k] = b[i];
        for (int j = 1; j <= res.siz; ++j) res.b[j] -= tmp;
      }
    }
    return res;
  }
} tr[N << 2];
inline void update(int k) {
  tr[k] = tr[k << 1] + tr[k << 1 | 1];
  return;
}
void build(int k, int l, int r) {
  if (l == r) {
    tr[k].a[1] = read();
    tr[k].b[1] = tr[k].siz = 1;
    return;
  }
  int mid = (l + r) >> 1;
  build(k << 1, l, mid);
  build(k << 1 | 1, mid + 1, r);
  return update(k);
}
inline void Tag(int k, int l, int r, int val) {
  tr[k].a[1] = val;
  tr[k].b[1] = r - l + 1;
  tr[k].siz = 1;
  tr[k].tag = val;
  return;
}
inline void down(int k, int l, int r) {
  if (tr[k].tag) {
    int mid = (l + r) >> 1;
    Tag(k << 1, l, mid, tr[k].tag);
    Tag(k << 1 | 1, mid + 1, r, tr[k].tag);
    tr[k].tag = 0;
  }
  return;
}
void modify(int k, int l, int r, int x, int y, int val) {
  if (x <= l && r <= y) return Tag(k, l, r, val);
  int mid = (l + r) >> 1;
  down(k, l, r);
  if (x <= mid) modify(k << 1, l, mid, x, y, val);
  if (y > mid) modify(k << 1 | 1, mid + 1, r, x, y, val);
  return update(k);
}
node Ask(int k, int l, int r, int x, int y) {
  if (x <= l && r <= y) return tr[k];
  int mid = (l + r) >> 1;
  down(k, l, r);
  if (y <= mid) return Ask(k << 1, l, mid, x, y);
  if (x > mid) return Ask(k << 1 | 1, mid + 1, r, x, y);
  return Ask(k << 1, l, mid, x, y) + Ask(k << 1 | 1, mid + 1, r, x, y);
}
int main() {
  n = read();
  m = read();
  p = 100 / read();
  build(1, 1, n);
  int op, l, r, x;
  while (m--) {
    op = read();
    l = read();
    r = read();
    if (op == 1) x = read(), modify(1, 1, n, l, r, x);
    if (op == 2) {
      node s = Ask(1, 1, n, l, r);
      cout << s.siz;
      for (int i = 1; i <= s.siz; ++i) cout << ' ' << s.a[i];
      cout << '\n';
    }
  }
  return 0;
}
