Takahashi is participating in a programming contest, AXC001. He has just submitted his code to Problem A.

The problem has N test cases, all of which must be passed to get an AC verdict.

Takahashi's submission has passed M cases out of the N test cases.

Determine whether Takahashi's submission gets an AC.

-----Constraints-----
 - 1 \leq N \leq 100
 - 0 \leq M \leq N
 - All values in input are integers.

-----Input-----
Input is given from Standard Input in the following format:
N M

-----Output-----
If Takahashi's submission gets an AC, print Yes; otherwise, print No.

-----Sample Input-----
3 3

-----Sample Output-----
Yes

All three test cases have been passed, so his submission gets an AC.

Difficulty: EASY

Solutions:
(A, B) = map(int, input().split())
print('Yes') if A == B else print('No')


(m, n) = map(int, input().split())
print('Yes' if m == n else 'No')


(n, m) = input().split()
print('YNeos'[n != m::2])


(n, k) = map(int, input().split())
print('Yes' if n == k else 'No')


rStr = input()
N = int(rStr.split(' ')[0])
M = int(rStr.split(' ')[1])
if N == M:
	print('Yes')
else:
	print('No')


(n, m) = [i for i in input().split()]
print('Yes' if n == m else 'No')


(N, M) = map(int, input().split())
if N == M:
	print('Yes')
else:
	print('No')


(a, b) = map(int, input().split())
ret = 'Yes' if a == b else 'No'
print(ret)


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


(n, m) = input().split()
if n == m:
	print('Yes')
else:
	print('No')


print('Yes' if len(set(input().split())) == 1 else 'No')


(a, b) = input().split()
print('Yes') if a == b else print('No')


input_line = input().rstrip().split()
if input_line[0] == input_line[1]:
	print('Yes')
else:
	print('No')


print('YNeos'[len(set(input().split())) > 1::2])


(H, N) = map(int, input().split())
print('Yes' if H == N else 'No')


a = input().split()
if a[0] == a[1]:
	print('Yes')
else:
	print('No')


(h, a) = map(int, input().split())
if h == a:
	print('Yes')
else:
	print('No')


(n, m) = map(int, input().split())
print('YNeos'[n != m::2])


(N, M) = map(int, input().split())
ans = 'Yes'
if N != M:
	ans = 'No'
print(ans)


(L, R) = input().split()
if L == R:
	print('Yes')
else:
	print('No')


print('NYoe s'[len(set(map(int, input().split()))) == 1::2])


(N, M) = input().split(' ')
print('Yes' if N == M else 'No')


print('YNeos'[eval(input().replace(' ', '!='))::2])


(N, M) = list(map(int, input().split()))
print(['No', 'Yes'][N == M])


(a, b) = input().split()
print(['No', 'Yes'][a == b])


print('Yes' if len(set(list(map(int, input().split())))) == 1 else 'No')


(N, M) = [int(n) for n in input().split()]
print('Yes' if N == M else 'No')


def resolve():
	(n, m) = map(int, input().split())
	print('Yes' if n == m else 'No')
resolve()


(H, W) = map(int, input().split())
print('Yes') if H == W else print('No')


(a, b) = map(int, input().split())
print('Yes' if a is b else 'No')


(a, b) = [int(x) for x in input().split()]
print(['No', 'Yes'][a == b])


(H, A) = input().split()
print('Yes' if H == A else 'No')


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


def main():
	(n, m) = map(int, input().split(' '))
	if n == m:
		print('Yes')
	else:
		print('No')

def __starting_point():
	main()
__starting_point()


if eval(input().replace(' ', '==')):
	print('Yes')
else:
	print('No')


(a, b) = [i for i in input().split()]
print('Yes' if a == b else 'No')


(a, b) = input().split()
print('YNeos'[a != b::2])


(A, B) = (int(x) for x in input().split())
print('Yes' if A == B else 'No')


(n, m) = input().split()
print('NYoe s'[n == m::2])


print(['', 'Yes', 'No'][len(set(input().split()))])


(n, m) = list(map(int, input().split()))
ans = 'No'
if n == m:
	ans = 'Yes'
print(ans)


def main():
	(N, M) = list(map(int, input().split()))
	if M == N:
		return 'Yes'
	else:
		return 'No'
print(main())


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


(n, m) = map(int, input().split())
print((n == m) * 'Yes' or 'No')


s = input().split()
if s[0] == s[1]:
	print('Yes')
else:
	print('No')


s = input().split()
print('YNeos'[s[0] != s[1]::2])


(I, U) = input().split()
print('Yes' if I == U else 'No')


(a, b) = map(int, input().split())
print('Yes' if a - b == 0 else 'No')


print((lambda x: 'Yes' if x[0] == x[1] else 'No')(input().split()))


from sys import stdin
nii = lambda : map(int, stdin.readline().split())
lnii = lambda : list(map(int, stdin.readline().split()))
(n, m) = nii()
print('Yes' if n == m else 'No')


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


(N, W) = map(int, input().split())
print('Yes' if N == W else 'No')


(a, b) = input().split()
print('Yes' if a != 0 and a == b else 'No')


(A, B) = map(int, input().split())
print('YNeos'[not A == B::2])


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


(a, c) = map(int, input().split())
print('Yes') if a == c else print('No')


(x, y) = input().split()
print('Yes' if x == y else 'No')


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


import math
(a, b) = input().split()
print('Yes' if a == b else 'No')


(r, t) = input().split()
if r == t:
	print('Yes')
else:
	print('No')


(n, m) = list(map(int, input().split()))
result = 'No'
if n == m:
	result = 'Yes'
print(result)


(N, M) = input().split()
print('NYoe s'[N == M::2])


from sys import setrecursionlimit, exit
setrecursionlimit(1000000000)

def main():
	(n, m) = map(int, input().split())
	if n == m:
		print('Yes')
	else:
		print('No')
main()


print(len(set(input().split())) == 1 and 'Yes' or 'No')


(N, M) = map(str, input().split())
print('Yes' if N == M else 'No')


(a, b) = map(int, input().split())
print(a == b and 'Yes' or 'No')


(N, K) = map(int, input().split())
print('Yes' if N == K else 'No')


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