#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int X = 0, w = 0;
  char ch = 0;
  while (!isdigit(ch)) {
    w |= ch == '-';
    ch = getchar();
  }
  while (isdigit(ch)) X = (X << 3) + (X << 1) + (ch ^ 48), ch = getchar();
  return w ? -X : X;
}
const int maxn = 2e5 + 10;
struct node {
  int l, r, id;
  node(int a = 0, int b = 0, int c = 0) {
    l = a;
    r = b;
    id = c;
  }
};
bool operator<(node a, node b) { return a.r < b.r; }
int vis[maxn];
vector<node> G[maxn];
queue<int> ans;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, k;
  cin >> n >> k;
  int xr = 0;
  for (int i = 1; i <= n; ++i) {
    int l, r;
    cin >> l >> r;
    G[l].push_back({l, r, i});
    xr = max(xr, r);
    vis[l]++;
    vis[r + 1]--;
  }
  priority_queue<node> q;
  long long sum = 0;
  for (int i = 1; i <= xr; ++i) {
    sum += vis[i];
    for (auto v : G[i]) q.push(v);
    while (sum > k) {
      if (!q.empty()) {
        node now = q.top();
        q.pop();
        ans.push(now.id);
        vis[now.r + 1]++;
        sum--;
      }
    }
  }
  cout << ans.size() << endl;
  while (!ans.empty()) {
    int now = ans.front();
    ans.pop();
    cout << now << " ";
  }
  return 0;
}
