import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

md = 10**9+7
# md = 998244353

n,s=LI()
pp=LI()

if n==1:
    print(1)
    print(1)
    exit()

ans=set()
ii=sorted(range(n),key=lambda i:pp[i])
i,j=ii[0],ii[1]
if pp[j]-pp[i]>s:ans.add(i+1)
i,j=ii[-2],ii[-1]
if pp[j]-pp[i]>s:ans.add(j+1)
for i,j,k in zip(ii,ii[1:],ii[2:]):
    if pp[k]-pp[j]>s and pp[j]-pp[i]>s:ans.add(j+1)

print(len(ans))
ans=sorted(ans)
print(*ans)