'''
be = open("be2.txt")
N,H = map(int,be.readline().split())
lista = []
for i in range(N):
    tol,ig = map(int,be.readline().split())
    lista.append([tol,ig,i+1])
be.close()
'''
N,H = map(int,input().split())
lista = []
for i in range(N):
    tol,ig = map(int,input().split())
    lista.append([tol,ig,i+1])

lista.sort(key=lambda x:(x[1],x[0]))
if N == 1:
    print(1,0)
    print(1)
    print()
elif N == 2:
    print(1,1)
    print(1)
    print(1)
else:
    Mester = [lista[0][2]]
    Fia = [lista[1][2]]
    Mvege = lista[0][1]
    Fvege = lista[1][1]
    for i in range(2,N):
        if lista[i][0] > Mvege and lista[i][0] > Fvege:
            if lista[i][0] - Mvege <= lista[i][0] - Fvege:
                Mvege = lista[i][1]
                Mester.append(lista[i][2])
            else:
                Fvege = lista[i][1]
                Fia.append(lista[i][2])
        elif lista[i][0] > Mvege:
            Mvege = lista[i][1]
            Mester.append(lista[i][2])
        elif lista[i][0] > Fvege:
            Fvege = lista[i][1]
            Fia.append(lista[i][2])

print(len(Mester),len(Fia))
for x in Mester:
    print(x,end=" ")
print()
for x in Fia:
    print(x,end=" ")