#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
int n, k;
struct seg {
  int l, r, id;
  bool operator<(const seg& a) const {
    if (r != a.r) return r < a.r;
    return l < a.l;
  }
} s[maxn];
int ma[maxn << 2], tag[maxn << 2];
void push_down(int x) {
  if (tag[x]) {
    ma[x << 1] += tag[x];
    tag[x << 1] += tag[x];
    ma[x << 1 | 1] += tag[x];
    tag[x << 1 | 1] += tag[x];
    tag[x] = 0;
  }
}
void update(int x, int l, int r, int L, int R, int d) {
  if (l == L && r == R) {
    ma[x] += d;
    tag[x] += d;
    return;
  }
  push_down(x);
  int mid = (l + r) >> 1;
  if (R <= mid)
    update(x << 1, l, mid, L, R, d);
  else if (L > mid)
    update(x << 1 | 1, mid + 1, r, L, R, d);
  else {
    update(x << 1, l, mid, L, mid, d);
    update(x << 1 | 1, mid + 1, r, mid + 1, R, d);
  }
  ma[x] = max(ma[x << 1], ma[x << 1 | 1]);
}
int getmax(int x, int l, int r, int L, int R) {
  if (l == L && r == R) return ma[x];
  push_down(x);
  int mid = (l + r) >> 1;
  if (R <= mid)
    return getmax(x << 1, l, mid, L, R);
  else if (L > mid)
    return getmax(x << 1 | 1, mid + 1, r, L, R);
  return max(getmax(x << 1, l, mid, L, mid),
             getmax(x << 1 | 1, mid + 1, r, mid + 1, R));
}
int main() {
  scanf("%d %d", &n, &k);
  for (int i = 1; i <= n; i++) scanf("%d %d", &s[i].l, &s[i].r), s[i].id = i;
  sort(s + 1, s + 1 + n);
  int l, r;
  vector<int> ans;
  for (int i = 1; i <= n; i++) {
    l = s[i].l;
    r = s[i].r;
    if (getmax(1, 1, 2e5, l, r) < k)
      update(1, 1, 2e5, l, r, 1);
    else
      ans.push_back(s[i].id);
  }
  printf("%d\n", (int)ans.size());
  for (int id : ans) printf("%d ", id);
  return 0;
}
