def jopa(govno: list, dungeon_master: int, index: int):
    if index == len(govno) - 1 or govno[index] < dungeon_master:
        return index + 1
    else:
        qnt = govno[index] // dungeon_master
        return max(
            jopa(govno, dungeon_master, i)
            for i in range(index+1, index + qnt+1)
            )


N = int(input())
diff = int(input())
count = 1
flag = True
jump_lengths = [int(input()) for _ in range(N)]

print(jopa(jump_lengths, diff, 0))