#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops,-ffloat-store")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
using namespace std;
const int m = 2e5;
const int maxn = 2e5 + 5;
int n, k, a[maxn], b[maxn];
vector<pair<int, int> > V[maxn];
vector<int> ans;
void readf() {
  cin >> n >> k;
  for (int i = 1; i <= n; ++i) {
    int l, r;
    cin >> l >> r;
    a[l]++;
    a[r + 1]--;
    V[l].emplace_back(r, i);
  }
  for (int i = 1; i <= m; ++i) a[i] += a[i - 1];
}
void solve() {
  priority_queue<pair<int, int> > pq;
  for (int i = 1; i <= m; ++i) a[i] = max(0, a[i] - k);
  int cnt = 0;
  for (int i = 1; i <= m; ++i) {
    cnt += b[i];
    for (auto it : V[i]) pq.push(it);
    a[i] += cnt;
    while (a[i] > 0 && pq.size() > 0) {
      pair<int, int> tmp = pq.top();
      pq.pop();
      ans.emplace_back(tmp.second);
      cnt--;
      b[tmp.first + 1]++;
      a[i]--;
    }
  }
  cout << ans.size() << '\n';
  for (auto x : ans) cout << x << ' ';
}
int main() {
  srand(time(NULL));
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  readf();
  solve();
}
