Too Many Segments (hard version)

题目链接：CodeForces - 1249D1

The only difference between easy and hard versions is constraints.

You are given nn 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 jjsuch that li≤j≤ri .

The integer point is called bad if it is covered by strictly more than k 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 nn and kk (1≤k≤n≤2⋅10) — the number of segments and the maximum number of segments by which each integer point can be covered.

The next nn lines contain segments. The i-th line contains two integers liand ri(1≤li≤ri≤2⋅105) — the endpoints of the ii -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 mm 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 

题意：有n条线段，对于每个点其覆盖次数不能超过k，问至少移除几条线段才能满足要求。

思路： 在一个点，其覆盖值如果大于k了，应该移除覆盖以这个点为起点的线段中右端点最大的一个，因为这样可以最多减少对后面点的覆盖，从而使移除的线段数最少。

对输入的线段按右端点从小到大排序，然后遍历到右端点的值超过k值时，就可以将其删除。

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<set>
#include<vector>
using namespace std;
const int N=2e5+10;
struct node
{
    int id;
    int r;
};
bool operator<(node a,node b)//----
{
    if(a.r!=b.r)
        return a.r<b.r;//右端点从小到大排序
    return a.id<b.id;//排下标的原因，有相同的区间时，set容器不能够储存，此时记录一下该数的下标
}
vector<node>v[N];
vector<int>sum;
int main()
{
    int n,k;
    scanf("%d%d",&n,&k);
    int a,b;
    node q;
    for(int i=1; i<=n; i++)
    {
        scanf("%d%d",&a,&b);
        q.id=i;
        q.r=b;
        v[a].push_back(q);//记录以a为起点的所有线段
    }
    set<node>s;
    for(int i=1; i<N; i++)
    {
        while(s.size()&&(*s.begin()).r<i)
            s.erase(*s.begin());
        for(int j=0; j<v[i].size(); j++)
            s.insert(v[i][j]);
        while(s.size()>k)
        {
            sum.push_back((*s.rbegin()).id);
            s.erase(*s.rbegin());
        }
    }
    printf("%d\n",sum.size());
    for(int i=0; i<sum.size(); i++)
        printf("%d ",sum[i]);
    return 0;
}