Binary search#9016

Binary search

5 seconds
256 megabytes
Very easy

A sorted array of integers is given. It is necessary to answer queries: whether the given number is present in the array.

Input

The first line contains two integers and q~(n, q \le 10^6). The second line contains integers sorted in ascending order. Each of the following lines contains one number . All numbers in the array do not exceed 10^9 by absolute value.

Output

For each query, print "YES" on a separate line if the number is present in the array, and "NO" otherwise.

Examples

Example 1

Loading
Loading

Example 3

Loading
Loading