#ENGLISHP25. Sequence Search
Sequence Search
Description
Given a sequence S of N numbers. Find the least index id so that S[id] equals to K.
Input Format
First line: two positive integers N (N <= 100) and K (K <= 100000).
Second line: N positive integers (<= 100000).
Output Format
One integer id.
8 5
2 4 7 8 5 3 9 5
5