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 [l_i; r_i] (l_i ≤ r_i) and it covers all integer points j such that l_i ≤ j ≤ r_i.

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 n and k (1 ≤ k ≤ n ≤ 200) — 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 l_i and r_i (1 ≤ l_i ≤ r_i ≤ 200) — the endpoints of the i-th segment.

Output

In the first line print one integer m (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 p_1, p_2, ..., p_m (1 ≤ p_i ≤ 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 
import heapq
    
def main():
    
    n,k=readIntArr()
    lr=[]
    for i in range(n):
        l,r=readIntArr()
        lr.append([l,r,i+1])
    
    lr.sort(key=lambda x:x[0])
    
    # store [r,idx] of segments
    # maxHeapRs=[]
    # minHeapRs=[]
    # removedIdxes=set()
    
    ans=[]
    
    cnts=0
    # for l,r,i in lr:
    #     while len(minHeapRs)>0 and minHeapRs[0][0]<l:
    #         leftestRIdx=minHeapRs[0][0]
    #         heapq.heappop(minHeapRs)
    #         if leftestRIdx not in removedIdxes: # not removed previously
    #             removedIdxes.add(leftestRIdx)
    #             cnts-=1
    #     heapq.heappush(minHeapRs,[r,i])
    #     heapq.heappush(maxHeapRs,[-r,i])
    #     cnts+=1
    #     while cnts>k: # get rid of segment with rightest r
    #         rightestRIdx=maxHeapRs[0][1]
    #         heapq.heappop(maxHeapRs)
    #         if rightestRIdx not in removedIdxes:
    #             removedIdxes.add(rightestRIdx)
    #             ans.append(rightestRIdx)
    #             cnts-=1
    
    def getMinR(storedRandI): # return minR and corresponding i and idx
        n=len(storedRandI)
        minR,ii=storedRandI[0]
        idx=0
        for j in range(1,n):
            if storedRandI[j][0]<minR:
                minR,ii=storedRandI[j]
                idx=j
        return [minR,ii,idx]
    
    def getMaxR(storedRandI): # return maxR and corresponding i and idx
        n=len(storedRandI)
        maxR,ii=storedRandI[0]
        idx=0
        for j in range(1,n):
            if storedRandI[j][0]>maxR:
                maxR,ii=storedRandI[j]
                idx=j
        return [maxR,ii,idx]

    storedRandI=[] # [r,i]
    ans=[]
    cnts=0
    for l,r,i in lr:
        while storedRandI and getMinR(storedRandI)[0]<l:
            minR,ii,idx=getMinR(storedRandI)
            storedRandI.pop(idx)
            cnts-=1
        storedRandI.append([r,i])
        cnts+=1
        while cnts>k:
            # print('cnts:{} l:{} r:{}'.format(cnts,l,r))
            maxR,ii,idx=getMaxR(storedRandI)
            storedRandI.pop(idx)
            cnts-=1
            ans.append(ii)
    
        # print('l:{} r:{} storedRAndI:{}'.format(l,r,storedRandI))
            
    
    print(len(ans))
    oneLineArrayPrint(ans)
    
    
    return

import sys
input=sys.stdin.buffer.readline #FOR READING PURE INTEGER INPUTS (space separation ok)
# input=lambda: sys.stdin.readline().rstrip("\r\n") #FOR READING STRING/TEXT INPUTS.
 
def oneLineArrayPrint(arr):
    print(' '.join([str(x) for x in arr]))
def multiLineArrayPrint(arr):
    print('\n'.join([str(x) for x in arr]))
def multiLineArrayOfArraysPrint(arr):
    print('\n'.join([' '.join([str(x) for x in y]) for y in arr]))
 
def readIntArr():
    return [int(x) for x in input().split()]
# def readFloatArr():
#     return [float(x) for x in input().split()]

def makeArr(defaultVal,dimensionArr): # eg. makeArr(0,[n,m])
    dv=defaultVal;da=dimensionArr
    if len(da)==1:return [dv for _ in range(da[0])]
    else:return [makeArr(dv,da[1:]) for _ in range(da[0])]
 
def queryInteractive(x,y):
    print('? {} {}'.format(x,y))
    sys.stdout.flush()
    return int(input())
 
def answerInteractive(ans):
    print('! {}'.format(ans))
    sys.stdout.flush()
 
inf=float('inf')
MOD=10**9+7
# MOD=998244353
 
 
for _abc in range(1):
    main()