Pallet Weight Rank Positions

A shipping yard weighs every pallet in today's batch. To build the daily weight manifest, the yard sorts these weights into non-decreasing order. Given the unsorted weights and a target weight, find every position (0-indexed) in the sorted manifest whose weight equals the target, listed in increasing order of position.

Input format

Line 1: two integers n and target, separated by a space. Line 2: n space-separated integers, the unsorted pallet weights.

Constraints

• 1 <= n <= 2000
• 0 <= weight <= 10^6 for every pallet weight
• 0 <= target <= 10^6

Output format

Print an integer k, the number of matching positions. If k > 0, print a second line with the k matching positions, in increasing order and separated by spaces. If k = 0, do not print a second line.

5 2
1 2 5 2 3

2
1 2

5 4
1 2 5 2 3

0