n, s = map(int, input().split())
P = [int(p)for p in input().split()]
Q = []
for i in range(n):
    Q.append((P[i], i+1))
Q.sort()
R = []
for i in range(n):
    if (i == 0 or Q[i-1][0] < Q[i][0]-s) and (i == n-1 or Q[i][0]+s < Q[i+1][0]):
        R.append(Q[i][1])
print(len(R))
print(*sorted(R))