The Rebel fleet is afraid that the Empire might want to strike back again. Princess Heidi needs to know if it is possible to assign R Rebel spaceships to guard B bases so that every base has exactly one guardian and each spaceship has exactly one assigned base (in other words, the assignment is a perfect matching). Since she knows how reckless her pilots are, she wants to be sure that any two (straight) paths – from a base to its assigned spaceship – do not intersect in the galaxy plane (that is, in 2D), and so there is no risk of collision.


-----Input-----

The first line contains two space-separated integers R, B(1 ≤ R, B ≤ 10). For 1 ≤ i ≤ R, the i + 1-th line contains two space-separated integers x_{i} and y_{i} (|x_{i}|, |y_{i}| ≤ 10000) denoting the coordinates of the i-th Rebel spaceship. The following B lines have the same format, denoting the position of bases. It is guaranteed that no two points coincide and that no three points are on the same line.


-----Output-----

If it is possible to connect Rebel spaceships and bases so as satisfy the constraint, output Yes, otherwise output No (without quote).


-----Examples-----
Input
3 3
0 0
2 0
3 1
-2 1
0 3
2 2

Output
Yes

Input
2 1
1 0
2 2
3 1

Output
No



-----Note-----

For the first example, one possible way is to connect the Rebels and bases in order.

For the second example, there is no perfect matching between Rebels and bases.

Difficulty: interview

Starter code:

Solutions:
a, b = list(map(int, input().split()))
if a==b: print("Yes")
else: print("No")


def check(a,b):
    ansa=b[0]-a[0]
    ansb=b[1]-a[1]
    return [ansa,ansb] 
while True:
    try:
        n,m=map(int,input().split())
        if n!=m:
            a=list()
            b=list()
            for i in range(n):
                a.append(list(map(int,input().split())))
            for i in range(m):
                b.append(list(map(int,input().split())))
            print('No')
        else:
            a=list()
            b=list()
            for i in range(n):
                a.append(list(map(int,input().split())))
            for i in range(m):
                b.append(list(map(int,input().split())))
            flag=False
            for i in range(len(a)):
                for j in range(i+1,len(a)):
                    for k in range(len(b)):
                        for l in range(k+1,len(b)):
                            ansa=check(a[i],a[j])
                            ansb=check(a[i],b[k])
                            ansc=check(a[i],b[l])
                            if (ansa[0]==ansb[0] and ansa[0]==ansc[0] and ansa[0]==0) or (ansa[0]!=0 and ansb[0]!=0 and ansc[0]!=0 and ansa[1]/ansa[0]==ansb[1]/ansb[0] and ansa[1]/ansa[0]==ansc[1]/ansc[0]):
                                print('No')
                                flag=True
                                break
                            else:
                                continue
                        if flag==True:
                            break
                    if flag==True:
                        break
                if flag==True:
                    break
            if flag==False:
                print('Yes')
    except EOFError:
        break

r, b = [int(i) for i in input().split()]
for i in range(r):
  discard = [int(i) for i in input().split()]
  
print("Yes" if r == b else "No")

str1=input()
l_1 = str1.split(' ')
tedad=int(l_1[0])
tedad1=int((l_1[1]))
for i in range(tedad):
    n=input()
for i in range(tedad1):
    n=input()


if tedad1==tedad:
    print('Yes')
else:
    print('No')

n,m=[int(x) for x in input().split()]
for i in range(n+m):
    s=input()
if n==m:
    print('Yes')
else:
    print('No')

a, b = list(map(int, input().split()))
if a==b: print("Yes")
else: print("No")

r, b = map(int, input().split())
for i in range(r + b):
    l = input().split()
if r == b:
    print('Yes')
else:
    print('No')

R, B = list(map(int, input().split()))

print(('No', 'Yes')[R == B])


r, b = list(map(int, input().split()))
if r == b:
    print('Yes')
else:
    print('No')


s = input()
in1 = s.split(' ')

R = int(in1[0])
B = int(in1[1])

print('Yes' if R==B else 'No')

a,b = list(map(int,input().split()))
for i in range(a+b):
    n,m = list(map(int,input().split()))
if a == b:
    print('Yes')
else:
    print('No')


x,y=map(int,input().split())
if(x == y):
    print("Yes")
else:
    print("No")

r, b = map(int,input().split())
print(('No', 'Yes')[r == b])

x,y=list(map(int,input().split()))
for k in range(x+y):
    a=input()
if x==y:
    print("Yes")
else:
    print("No")
    


l = input().split(' ')
print("Yes" if int(l[0]) == int(l[1]) else "No")

(R,B)=map(int,input().split())
for i in range(R+B):
    x=input()
if R==B:
    print('Yes')
else:
    print('No')