#include <bits/stdc++.h>
using namespace std;
long long GCD(long long a, long long b) { return b ? GCD(b, a % b) : a; }
long long lcm(long long a, long long b) { return a * b / GCD(a, b); }
int lb(int x) { return x & (-x); }
const long long N = 2e5 + 7;
const long long inf = 1e18 + 1;
const long long mod2 = 998244353;
const long long mod1 = 1e9 + 7;
const int P1 = 13331;
const int P2 = 131;
const double eps = 1e-6;
const double dbinf = 1e18 + 7;
const long long mod3 = 1e6 + 7;
int n, k;
int b[N];
vector<pair<int, int> > a[N];
priority_queue<pair<int, int> > q;
int main() {
  cin >> n >> k;
  for (int i = 1, l = 1, r = 1; i <= n; i++) {
    cin >> l >> r;
    b[l]++;
    b[r + 1]--;
    a[l].push_back({r, i});
  }
  vector<int> ans;
  for (int i = 1; i <= N - 1; i++) {
    b[i] += b[i - 1];
    while (!q.empty() && q.top().first < i) q.pop();
    for (auto& v : a[i]) q.push(v);
    while (b[i] > k) {
      pair<int, int> tmp = q.top();
      q.pop();
      ans.push_back(tmp.second);
      b[i]--;
      b[tmp.first + 1]++;
    }
  }
  cout << ans.size() << "\n";
  for (auto& v : ans) cout << v << " ";
  cout << "\n";
  return 0;
}
