#include <bits/stdc++.h>
using namespace std;
int a[200010];
vector<pair<int, int> > tree[600010];
int tag[600010];
int n, m, num, P;
namespace FastIO {
constexpr int SIZE = (1 << 21) + 1;
int num = 0, f;
char ibuf[SIZE], obuf[SIZE], que[65], *iS, *iT, *oS = obuf,
                                                *oT = obuf + SIZE - 1, c;
inline void flush() {
  fwrite(obuf, 1, oS - obuf, stdout);
  oS = obuf;
}
inline void putc(char c) {
  *oS++ = c;
  if (oS == oT) flush();
}
inline void getc(char &c) {
  for (c = (iS == iT ? (iT = ((iS = ibuf) + fread(ibuf, 1, SIZE, stdin)),
                       (iS == iT ? EOF : *iS++))
                     : *iS++);
       (c != '0' && c != '1') && c != EOF;
       c = (iS == iT ? (iT = ((iS = ibuf) + fread(ibuf, 1, SIZE, stdin)),
                       (iS == iT ? EOF : *iS++))
                     : *iS++))
    ;
}
inline void reads(char *st) {
  char c;
  int n = 0;
  getc(st[++n]);
  for (c = (iS == iT ? (iT = ((iS = ibuf) + fread(ibuf, 1, SIZE, stdin)),
                       (iS == iT ? EOF : *iS++))
                     : *iS++);
       c == '0' || c == '1';
       c = (iS == iT ? (iT = ((iS = ibuf) + fread(ibuf, 1, SIZE, stdin)),
                       (iS == iT ? EOF : *iS++))
                     : *iS++))
    st[++n] = c;
}
template <class I>
inline void read(I &x) {
  for (f = 1, c = (iS == iT ? (iT = ((iS = ibuf) + fread(ibuf, 1, SIZE, stdin)),
                              (iS == iT ? EOF : *iS++))
                            : *iS++);
       c < '0' || c > '9';
       c = (iS == iT ? (iT = ((iS = ibuf) + fread(ibuf, 1, SIZE, stdin)),
                       (iS == iT ? EOF : *iS++))
                     : *iS++))
    if (c == '-') f = -1;
  for (x = 0; c >= '0' && c <= '9';
       c = (iS == iT ? (iT = ((iS = ibuf) + fread(ibuf, 1, SIZE, stdin)),
                       (iS == iT ? EOF : *iS++))
                     : *iS++))
    x = (x << 3) + (x << 1) + (c & 15);
  x *= f;
}
template <class I>
inline void print(I x) {
  if (x < 0) putc('-'), x = -x;
  if (!x) putc('0');
  while (x) que[++num] = x % 10 + 48, x /= 10;
  while (num) putc(que[num--]);
}
struct Flusher_ {
  ~Flusher_() { flush(); }
} io_Flusher_;
}  // namespace FastIO
using FastIO ::print;
using FastIO ::putc;
using FastIO ::read;
using FastIO ::reads;
inline void pushdown(int rex, int l, int mid, int r) {
  if (tag[rex]) {
    tree[rex + rex].clear();
    tree[rex + rex + 1].clear();
    tree[rex + rex].push_back(make_pair(tag[rex], mid - l + 1));
    tree[rex + rex + 1].push_back(make_pair(tag[rex], r - mid));
    tag[rex + rex] = tag[rex], tag[rex + rex + 1] = tag[rex];
    tag[rex] = 0;
  }
}
vector<pair<int, int> > merge(vector<pair<int, int> > ox,
                              vector<pair<int, int> > oy) {
  vector<pair<int, int> > o;
  o = oy;
  for (int i = 0; i < (int)ox.size(); i++) {
    int flag = 0;
    for (int j = 0; j < (int)o.size(); j++)
      if (ox[i].first == o[j].first) {
        o[j].second += ox[i].second;
        flag = 1;
        break;
      }
    if (flag) continue;
    o.push_back(ox[i]);
    if ((int)o.size() <= num) continue;
    int minn = n;
    for (int j = 0; j < (int)o.size(); j++)
      if (o[j].second < minn) minn = o[j].second;
    vector<pair<int, int> > p;
    for (int j = 0; j < (int)o.size(); j++)
      if (o[j].second > minn)
        p.push_back(make_pair(o[j].first, o[j].second - minn));
    o = p;
  }
  return o;
}
void build(int rex, int l, int r) {
  if (l == r) {
    tree[rex].push_back(make_pair(a[l], 1));
    return;
  }
  int mid = (l + r) >> 1;
  build(rex + rex, l, mid);
  build(rex + rex + 1, mid + 1, r);
  tree[rex] = merge(tree[rex + rex], tree[rex + rex + 1]);
}
void change(int rex, int l, int r, int x, int y, int z) {
  if (l == x && r == y) {
    tag[rex] = z;
    tree[rex].clear();
    tree[rex].push_back(make_pair(z, r - l + 1));
    return;
  }
  int mid = (l + r) >> 1;
  pushdown(rex, l, mid, r);
  if (y <= mid)
    change(rex + rex, l, mid, x, y, z);
  else if (x > mid)
    change(rex + rex + 1, mid + 1, r, x, y, z);
  else
    change(rex + rex, l, mid, x, mid, z),
        change(rex + rex + 1, mid + 1, r, mid + 1, y, z);
  tree[rex] = merge(tree[rex + rex], tree[rex + rex + 1]);
}
vector<pair<int, int> > query(int rex, int l, int r, int x, int y) {
  if (l == x && r == y) return tree[rex];
  int mid = (l + r) >> 1;
  pushdown(rex, l, mid, r);
  if (y <= mid)
    return query(rex + rex, l, mid, x, y);
  else if (x > mid)
    return query(rex + rex + 1, mid + 1, r, x, y);
  else
    return merge(query(rex + rex, l, mid, x, mid),
                 query(rex + rex + 1, mid + 1, r, mid + 1, y));
}
int main() {
  read(n), read(m), read(P);
  num = 100 / P;
  for (int i = 1; i <= n; i++) read(a[i]);
  build(1, 1, n);
  while (m--) {
    int cas;
    read(cas);
    if (cas == 1) {
      int l, r, k;
      read(l), read(r), read(k);
      change(1, 1, n, l, r, k);
    } else {
      int l, r;
      read(l), read(r);
      vector<pair<int, int> > o = query(1, 1, n, l, r);
      print(o.size());
      for (int i = 0; i < (int)o.size(); i++) putc(' '), print(o[i].first);
      putc('\n');
    }
  }
}
