Devu has an array A consisting of N positive integers. He would like to perform following operation on array.

- Pick some two elements a, b in the array (a could be same as b, but their corresponding indices in the array should not be same).
Remove both the elements a and b and instead add a number x such that x lies between min(a, b) and max(a, b), both inclusive, (i.e. min(a, b) ≤ x ≤ max(a, b)).

Now, as you know after applying the above operation N - 1 times, Devu will end up with a single number in the array. He is wondering whether it is possible to do the operations in such a way that he ends up a number t. 

He asks your help in answering Q such queries, each of them will contain an integer t and you have to tell whether it is possible to end up t. 

-----Input-----
There is only one test case per test file.
First line of the input contains two space separated integers N, Q denoting number of elements in A and number of queries for which Devu asks your help, respectively
Second line contains N space separated integers denoting the content of array A.

Each of the next Q lines, will contain a single integer t corresponding to the query.

-----Output-----
Output Q lines, each containing "Yes" or "No" (both without quotes) corresponding to the answer of corresponding query.

-----Constraints-----
- 1 ≤ N, Q ≤ 105
- 0 ≤ t ≤ 109

-----Subtasks-----
Subtask #1 : 30 points
- 1 ≤ Ai ≤ 2

Subtask #2 : 70 points
- 1 ≤ Ai ≤ 109

-----Example-----
Input 1:
1 2
1
1
2

Output:
Yes
No

Input 2:
2 4
1 3
1
2
3
4

Output:
Yes
Yes
Yes
No

-----Explanation-----
In the first example, Devu can't apply any operation. So the final element in the array will be 1 itself. 

In the second example,
Devu can replace 1 and 3 with any of the numbers among 1, 2, 3. Hence final element of the array could be 1, 2 or 3.

Difficulty: interview

Starter code:

Solutions:
n,m=[int(x) for x in input().split()]
k=[int(x) for x in input().split()]
a=min(k)
b=max(k)
for i in range(m):
 c=int(input())
 if c>=a and c<=b:
  print('Yes')
 else:
  print('No')

n,m=[int(x) for x in input().split()]
t=[int(x) for x in input().split()]
p=min(t)
q=max(t)
for i in range(m):
 r=int(input())
 if r>=p and r<=q:
  print('Yes')
 else:
  print('No')

n,m=[int(x) for x in input().split()]
k=[int(x) for x in input().split()]
a=min(k)
b=max(k)
for i in range(m):
 c=int(input())
 if c>=a and c<=b:
  print('Yes')
 else:
  print('No')

# cook your dish here
n,k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
l = min(a)
h = max(a)
for i in range(k) :
 q = int(input())
 if q>= l and q<=h :
  print("Yes")
 else:
  print("No")

# cook your dish here
n,m=map(int,input().split())
a=[int(x) for x in input().split()]
mh=min(a)
mp=max(a)
for i in range(m):
 b=int(input())
 if(b<=mp and b>=mh):
  print("Yes")
 else:
  print("No")

# cook your dish here
n,q=map(int,input().split())
l=[int(x) for x in input().split()]
mn=min(l)
mx=max(l)
for i in range(q):
 k=int(input())
 if(k<=mx and k>=mn):
  print("Yes")
 else:
  print("No")

# cook your dish here
n,q=map(int,input().split())
l=list(map(int,input().split()))
mini=min(l)
maxi=max(l)
for i in range(q):
 m=int(input())
 if m<=maxi and m>=mini:
  print("Yes")
 else:
  print("No")

n,q=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
start=a[0]
end=a[n-1]
for i in range(q):
 num=int(input())
 if(start<=num<=end):
  print("Yes")
 else:
  print("No")


def chk(a,q,n):
 l = a[0]
 m = a[n - 1]
 if q >= l and q <= m :
  return("Yes")
 return "No"
def main():
 n,q=list(map(int,input().split()))
 A = list(map(int,input().split()))
 A.sort()
 while(q > 0):
  q-=1
  ques = int(input())
  print(chk(A,ques,n))

def __starting_point():
 main()

__starting_point()


def chk(a,q):
 l = a[0]
 m = a[len(a) - 1]
 if q >= l and q <= m :
  return("Yes")
 return "No"
def main():
 n,q=list(map(int,input().split()))
 A = list(map(int,input().split()))
 A.sort()
 while(q > 0):
  q-=1
  ques = int(input())
  print(chk(A,ques))

def __starting_point():
 main()

__starting_point()

n,q = list(map(int, input().split()))
a = [int(i) for i in input().split()]
p = min(a)
z = max(a)
for i in range(q):
 t = int(input())
 if p<=t<=z:
  print('Yes')
 else:
  print('No')


import collections
from collections import defaultdict
import math


#for _ in range(int(input())):
#n=int(input())
#s=input()
#n,m=[int(x) for x in input().split()]
n,z=[int(x) for x in input().split()]
a=[int(x) for x in input().split()]
p=min(a) 
q=max(a)
for i in range(z):
 if p<=int(input())<=q:
   print("Yes")
 else:
  print("No") 

# cook your dish here
n,q=list(map(int,input().split()))
l=list(map(int,input().split()))
mi=min(l)
mx=max(l)
for i in range(q):
 m=int(input())
 if m<=mx and m>=mi:
  print("Yes")
 else:
  print("No")


n,q=list(map(int,input().split()))
l=list(map(int,input().split()))
mi=min(l)
mx=max(l)
for i in range(q):
 m=int(input())
 if m<=mx and m>=mi:
  print("Yes")
 else:
  print("No")


n,q = list(map(int,input().split()))
l = list(map(int,input().split()))
a = max(l)
b = min(l)
for i in range(q):
 y = int(input())
 if y>=b and y<=a:
  print("Yes")
 else:
  print("No")


n,q=list(map(int,input().split()))
a=list(map(int,input().split()))
x=max(a)
y=min(a)
for i in range(q):
 p=int(input())
 if p<=x and p>=y:
  print('Yes')
 else:
  print('No')


n, q = map(int, input().split())
arr = list(map(int, input().split()))
maximum = max(arr)
minimum = min(arr)
for i in range(q):
 t = int(input())
 if t >= minimum and t <= maximum:
  print("Yes")
 else:
  print("No")

n,q=list(map(int,input().split()))
a1=list(map(int,input().split()))
b=min(a1)
c=max(a1)
for i in range(q):
 s=int(input())
 if(s>=b and s<=c):
  print("Yes")
 else:
  print("No")


def query(ar, k, a, b):
 return "Yes" if k <= a and k >= b else "No"
 
def __starting_point():
 n, t = map(int, input().split())
 ar = list(map(int, input().split()))
 large, small = max(ar), min(ar)
 for i in range(t):
  k = int(input())
  print(query(ar, k, large, small))
__starting_point()

# cook your dish here

def query(ar, k, a, b):
 return "Yes" if k <= a and k >= b else "No"
 
def __starting_point():
 n, t = map(int, input().split())
 ar = list(map(int, input().split()))
 large, small = max(ar), min(ar)
 for i in range(t):
  k = int(input())
  print(query(ar, k, large, small))
__starting_point()

n,q=list(map(int,(input()).split()))
numbers=list(map(int,(input()).split()))
b=min(numbers)
c=max(numbers)
for _ in range(q):
 t=int(input())
 if t>=b and t<=c:
  print("Yes")
 else:
  print("No")

# cook your dish here
n,q=list(map(int,(input()).split()))
a=list(map(int,(input()).split()))
b=min(a)
c=max(a)
for i in range(q):
 t=int(input())
 if t>=b and t<=c:
  print("Yes")
 else:
  print("No")


# cook your dish here
n,q=list(map(int,(input()).split()))
a=list(map(int,(input()).split()))
b=min(a)
c=max(a)
for i in range(q):
 t=int(input())
 if t>=b and t<=c:
  print("Yes")
 else:
  print("No")


# cook your dish here
n,q=list(map(int,(input()).split()))
a=list(map(int,(input()).split()))
l=[]
for j in range(1,max(a)+1):
 if min(a)<=j and j<=max(a):
  l.append(j)
for i in range(q):
 t=int(input())
 if t in l:
  print("Yes")
 else:
  print("No")


x,y=map(int,input().split())
l=list(map(int,input().split()))
k=min(l)
l=max(l)
for i in range(y):
 a=int(input())
 if a>=k and a<=l:print('Yes')
 else:print('No')