N,K=map(int,input().split())
Ti = []
Hi= []
V = [[1]]
for i in range(N):
    T,H=map(int,input().split())
    Ti.append(T)
    Hi.append(H)
D = [Hi[0]]
for i in range(1,N):
    z = i-1
    while z>=0 and Ti[i]-Ti[z]<K:
        z -= 1
    if z<0:
        D.append(max(Hi[i],D[i-1]))
        if Hi[i] > D[i-1]:
            V.append([i+1])
        else:
            V.append(V[-1])
    else:
        D.append(max(D[i-1],Hi[i]+D[z]))
        if Hi[i]+D[z]>D[i-1]:
            V.append(V[z]+[i+1])
        else:
            V.append(V[-1])
print(D[-1])
print(len(V[-1]),end=" ")
for x in V[-1]:
    print(x,end=" ")