# Binary search

Very easy

Execution time limit is 5 seconds

Runtime memory usage limit is 256 megabytes

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

## Input

The first line contains two integers $n$ and $q(n,q≤10_{6})$. The second line contains $n$ integers sorted in ascending order. Each of the following $q$ lines contains one number $x$. 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 $x$ is present in the array, and "NO" otherwise.

## Examples

Input #1

Answer #1

Input #3

Answer #3

Submissions 10K

Acceptance rate 43%