e-olymp
Problems

Binary search

Binary search

Sorted array of n integers is given. You must answer q queries: whether the given number x is in the array.

Input

First line contains two numbers n and q (n, q106). Second line contains n integers sorted in increasing order. Each of the next q lines contains value of x. The numbers in array do not exceed 109 by absolute value.

Output

For each value of x print on a separate line "YES" if x is present in array and "NO" otherwise.

Time limit 3 second
Memory limit 128 MiB
Input example #1
6 3
2 4 4 8 11 14
10
4
2
Output example #1
NO
YES
YES
Input example #2
8 4
-8 -8 -1 1 3 4 6 8
4
10
-4
-8
Output example #2
YES
NO
NO
YES