G - Too Many Segments (hard version) （CodeForces - 1249D2）

The only difference between easy and hard versions is constraints.

You are given n segments on the coordinate axis OX. Segments can intersect, lie inside each other and even coincide. The i-th segment is [li;ri] (li≤ri) and it covers all integer points jj such that li≤j≤ri.

The integer point is called bad if it is covered by strictly more than kk segments.

Your task is to remove the minimum number of segments so that there are no bad points at all.

Input

The first line of the input contains two integers n and k (1≤k≤n≤2⋅105) — the number of segments and the maximum number of segments by which each integer point can be covered.

The next n lines contain segments. The i-th line contains two integers li and ri (1≤li≤ri≤2⋅105) — the endpoints of the i-th segment.

Output

In the first line print one integer mm (0≤m≤n) — the minimum number of segments you need to remove so that there are no bad points.

In the second line print m distinct integers p1,p2,…,pm (1≤pi≤n) — indices of segments you remove in any order. If there are multiple answers, you can print any of them.

Examples

Input

7 2
11 11
9 11
7 8
8 9
7 8
9 11
7 9

Output

3
4 6 7 

Input

5 1
29 30
30 30
29 29
28 30
30 30

Output

3
1 4 5 

Input

6 1
2 3
3 3
2 3
2 2
2 3
2 3

Output

4
1 3 5 6 

 这一题用容器写会比较简单，首先存入数，从每个数的开头存，则最后的数就是要删的最佳选择，因为每个数都是连着的，最后的数就是最长的数。这个时候可以从1开始遍历，也可以求个最大最小值，缩小 遍历值。

 

#include <stdio.h>
#include<string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
using namespace std;
const int N=2e5+20;
struct node
{
    int y, id;
} ans[N];
vector<node>v[N];
set<node>s;
bool operator < (node a, node b)
{
    if(a.y == b.y)      
        return a.id < b.id;
    return a.y < b.y;
}
int a[N];
int main()
{
    int n, k;
    scanf("%d%d",&n,&k);
    for(int i=1; i<=n; i++)
    {
        node t;
        int a, b;
        scanf("%d%d",&a,&b);
        t.id = i;
        t.y = b;
        v[a].push_back(t);
    }
    int cnt=0;
    for(int i=1; i<mx; i++)
    {
        while(s.size()&&(*s.begin()).y<i)      
                s.erase(*s.begin());
        for(int j=0; j<v[i].size(); j++)   
                 s.insert(v[i][j]);
        while(s.size()>k)
        {
            ans[++cnt] = *s.rbegin();
            s.erase(*s.rbegin());
        }
    }
    printf("%d\n",cnt);
    for(int i=1; i<=cnt; i++)
    {
        printf("%d%c",ans[i].id,i==cnt?'\n':' ');
    }
    return 0;
}