english-25 Sequence Search

描述

Given a sequence S of N numbers. Find the least index id so that S[id] equals to K.

输入

First line: two positive integers N (N <= 100) and K (K <= 100000).Second line: N positive integers (<= 100000).

输出

One integer id.

样例输入

1
28 5
2 4 7 8 5 3 9 5

样例输出

15

限制

• 时间限制：1000ms
• 内存限制：128MB