Too Many Segments (easy version)

题目链接：CodeForces - 1249D1

The only difference between easy and hard versions is constraints.

You are given nn segments on the coordinate axis OXOX. Segments can intersect, lie inside each other and even coincide. The ii-th segment is [li;ri][li;ri] (li≤rili≤ri) and it covers all integer points jj such that li≤j≤rili≤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 badpoints at all.

Input

The first line of the input contains two integers nn and kk (1≤k≤n≤2001≤k≤n≤200) — 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 ii-th line contains two integers lili and riri (1≤li≤ri≤2001≤li≤ri≤200) — the endpoints of the ii-th segment.

Output

In the first line print one integer mm (0≤m≤n0≤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,…,pmp1,p2,…,pm (1≤pi≤n1≤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
1 4 7 

Input

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

Output

3
1 2 4 

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<algorithm>
using namespace std;
struct node
{
    int L;
    int R;
    int len;
    int id;
} q[210];
int ans[210];
int num[210];
int cmp(node u,node v)
{
    if(u.R!=v.R)
       return u.R<v.R; 
    else
        return u.L<v.L;
}
int main()
{
    int n,k;
    scanf("%d%d",&n,&k);
    memset(ans,0,sizeof(ans));
    memset(num,0,sizeof(num));
    int a,b;
    for(int i=1; i<=n; i++)
    {
        scanf("%d%d",&a,&b);
        q[i-1].L=a;
        q[i-1].R=b;
        q[i-1].id=i;
    }
    sort(q,q+n,cmp);
    int s=0;
    for(int i=0; i<n; i++)
    {
        for(int j=q[i].L; j<=q[i].R; j++)
        {
            num[j]++;
            if(num[j]>k)
            {
                ans[s++]=q[i].id;
                break;
            }
        }
    }
    printf("%d\n",s);
    for(int i=0; i<s; i++)
        printf("%d ",ans[i]);
    return 0;
}