Problem:
 Score : 100 points    Problem Statement  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 1 3 3      Sample Output 1 Yes  All three test cases have been passed, so his submission gets an AC.       Sample Input 2 3 2      Sample Output 2 No  Only two out of the three test cases have been passed, so his submission does not get an AC.       Sample Input 3 1 1      Sample Output 3 Yes

Solution (Python):
k = [int(i) for i in input().split()]
ans='No'
if k[0] == k[1]: ans='Yes'
print(ans)

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

Solution (Python):
from sys import stdin

n,m = [int(x) for x in stdin.readline().rstrip().split()]

if n == m:
    print("Yes")
else:
    print("No")

Solution (Python):
n, m = map(int,input().split())

if n == m:
    print('Yes')
else:
    print('No')

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

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

Solution (Python):
n,m = map(int,input().split())
print("Yes" if n==m else "No")

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

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

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

Solution (Python):
n, m = map(int, input().split())

print("Yes" if n == m else "No")

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

Solution (Python):
import sys
input = lambda: sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
a = list(map(int, input().split()))
if a[0] == a[1]:
  print("Yes")
else:
  print("No")

Solution (Python):
n, m = map(int, input().split())

ans = "No"
if n == m: ans = "Yes"

print(ans)

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

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

Solution (Python):
n, m = map(int, input().split())
print("Yes" if n == m else "No")

Solution (Python):
def main():
    n, m = map(int, input().split())

    if n == m:
        print("Yes")
    else:
        print("No")
    
if __name__ == "__main__":
    main()

Solution (Python):
import sys
input = sys.stdin.readline

n, m = list(map(int, input().split()))

if n == m:
    print("Yes")
else:
    print("No")

Solution (Python):
n,m = map(int,input().split())
if n == m:
    print("Yes")
else:
    print("No")

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

Solution (Python):
N,M=map(int,input().split())

if N==M:
  print('Yes')
else:
  print('No')

Solution (Python):
n, m = map(int,input().split())

if n == m:
  print("Yes")
else:
  print("No")

Solution (Python):
import sys

input = lambda: sys.stdin.readline().rstrip()


def solve():
    N, M = map(int, input().split())

    if N == M:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    solve()

Solution (Python):
N, M = map(int, input().split())

if N == M:
    print('Yes')
else:
    print('No')

Solution (Python):
n, m = map(int, input().split())

if n == m:
	print('Yes')
else:
  	print('No')

Solution (Python):
n,m = input().split()

if n == m:
    print('Yes')
else:
    print('No')

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

Solution (Python):
print("Yes" if len(set(input().split()))==1 else "No")

Solution (Python):
def main():
    N, M = map(int, input().split())
    if N == M:
        print("Yes")
        exit(0)
    print("No")


if __name__ == "__main__":
    main()

Solution (Python):
a,b=input().split()
if a==b:
  print("Yes")
else:
  print("No")

Solution (Python):
n, m = input().split()
if n == m:
  print("Yes")
else:
  print("No")

Solution (Python):
n,m = map(int,input().split())

if n==m:
    print("Yes")
else:
    print("No")

Solution (Python):
N, M = map(int,input().split())

if N == M:
    print("Yes")
else:
    print("No")

Solution (Python):
N, M = map(int, input().split())

if N == M:
    print('Yes')
else:
    print('No')

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

Solution (Python):
a,b=map(int,input().split());print('YNeos'[a>b::2])

Solution (Python):
a = input().split()
b = a[0]
c = a[1]
if b == c:
  	print("Yes")
else:
	print("No")

Solution (Python):
n, m = map(int, input().split())

if n == m:
  print("Yes")
else:
  print("No")

Solution (Python):
n, m = input().split()
if n == m:
    print("Yes")
else :
    print("No")

Solution (Python):
n,m=map(int,input().split())
if n==m:
    print("Yes")
else:
    print("No")

Solution (Python):
N,M=input().split()
N=int(N); M=int(M);
if(N==M):
  print("Yes")
else:
  print("No")

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

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

Solution (Python):
import sys
import decimal 

def input():
    return sys.stdin.readline().strip()

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

main()

Solution (Python):
n, m = map(int, input().split())

if n == m:
    print('Yes')
else:
    print('No')

Solution (Python):
n,m = map(int,input().split())
if n ==m:
  print("Yes")
else:
  print("No")

Solution (Python):
N, M = map(int, input().split())

print('Yes' if N == M else 'No')

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

Solution (Python):
l = input().split()
n, m = int(l[0]), int(l[1])
if n==m:
  print("Yes")
else:
  print("No")

Solution (Python):
N, M = map(int,input().split())

if N == M:
    print("Yes")
else:
    print("No")

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

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

Solution (Python):

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

Solution (Python):
def main():
  num = list(map(int,input().split()))
  if num[0]==num[1]:
    print("Yes")
  else:
    print("No")

main()

Solution (Python):
a,b = map(int,input().split())

if (a == b):
    print("Yes")
else:
    print("No")

Solution (Python):

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

Solution (Python):
N, M = (int(x) for x in input().split())

print('Yes' if N == M else 'No')

Solution (Python):
N,M=map(int,input().split())
if N!=M:
  print("No")
else:
  print("Yes")

Solution (Python):
N,M=input().split()
if N==M:
  print("Yes")
else:
  print("No")

Solution (Python):
n, m = map(int, input().split())

if n <= m:
  print('Yes')
else:
  print('No')

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

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

if __name__ == "__main__":
    main()

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

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

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

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

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

Solution (Python):
n,m = map(int,input().split())

print('Yes' if n == m else 'No')

Solution (Python):
N,M = (int(x) for x in open(0).read().split())
if N != M:
    print('No')
else:
    print('Yes')

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

Solution (Python):
n,m = map(int,input().split())
if n <= m:
  print("Yes")
else:
  print("No")

Solution (Python):
n, m = map(int, input().split())

if n==m:
    print("Yes")
else:
    print('No')

Solution (Python):
N,M=map(int,input().split())

if N==M:print("Yes")
else:print("No")

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

Solution (Python):
def resolve():
    n, m = list(map(int, input().split()))

    print('Yes' if n == m else 'No')
resolve()

Solution (Python):
A,B=map(int,input().split())
if A == B:
  print("Yes")
else:
  print("No")

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

Solution (Python):
def main():
    N,M = map(int, input().split())
    if M==N:
        print("Yes")
    else:
        print("No")

main()

Solution (Python):
n,m=map(int,input().split())
if n==m:
  print("Yes")
else:
  print("No")

Solution (Python):
N, M = map(int, input().split())
print("{}".format("Yes" if N == M else "No"))

Solution (Python):

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines


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


if __name__ == '__main__':
    main()

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

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

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

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

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

Solution (Python):
N, M = map(int, input().split())

if N == M:
    print('Yes')
else:
    print('No')

Solution (Python):
N, M = map(int, input().split())

if N == M:
    print("Yes")
else:
    print("No")

Solution (Python):
N, M = map(int, input().split())

if N == M:
    print('Yes')
else:
    print('No')

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

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

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

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

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

Solution (Python):
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

n,m = mi()

if n == m:
    print('Yes')
else:
    print('No')

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

Solution (Python):
N, M = map(int, input().split())

if N > M:
  print('No')
else:
  print('Yes')

Solution (Python):
N,M = map(int, input().split())

if N == M:
  print('Yes')
else:
  print('No')

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

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

Solution (Python):
n,m=map(int,input().split())
if(n==m):print("Yes")
else:print("No")

Solution (Python):
N,M=input().split()
if N==M:
  print("Yes")
else:
  print("No")

Solution (Python):
N,M = map(int,input().split())

if M >= N :
    print('Yes')
else:
    print('No')

Solution (Python):
n1, n2 = [int(i) for i in input().split()]

if n1 == n2:
    print("Yes")
else:
    print("No")

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

Solution (Python):
n,m= map(int, input().split())
print("No" if m<n else "Yes")

Solution (Python):
n,m = map(int,input().split())
if n == m:
    print("Yes")
else:
    print("No")

Solution (Python):
def main():
  N, M = map(int, input().split())
  if N == M:
    print("Yes")
  else:
    print("No")
if __name__ == "__main__":
  main()

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

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

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

Solution (Python):
N, M = map(int, input().split())

if(N == M):
    print('Yes')
else:
    print('No')

Solution (Python):
n,m=map(int,input().split())

if n==m:
  print('Yes')
  
else:
  print('No')

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

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

Solution (Python):
def main():
    n, m = list(map(int, input().split()))
    print("Yes" if n == m else "No")

if __name__ == '__main__':
    main()

Solution (Python):
N, M = map(int, input().split())

if N == M:
  print('Yes')
else:
  print('No')

Solution (Python):
n,m = map(int,input().split())
if n == m:
    print("Yes")
else:
    print("No")

Solution (Python):
n,m=map(int,input().split())
if n==m:
    print("Yes")
else:
    print("No")

Solution (Python):
a, b = map(int, input().split())

if a == b:
    print("Yes")
else:
    print("No")

Solution (Python):
n,m = map(int,input().split())

if n==m:
  print('Yes')
else:
  print('No')

Solution (Python):
print("Yes" if len(set(map(int,input().split())))==1 else "No")

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

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

Solution (Python):
n, m = map(int, input().split())

if n == m:
    print('Yes')
else:
    print('No')

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

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

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

Solution (Python):
n,m = input().split()
if n==m :
    print("Yes")
else :
    print("No")

Solution (Python):
n,m = map(int, raw_input().split(' '))
print 'Yes' if m == n else 'No'

Solution (Python):
N, M = map(int, input().split())

if N == M:
    print('Yes')
else:
    print('No')

Solution (Python):
n,m=input().split()
if(n==m):
    print("Yes\n")
else:
    print("No\n")

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

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

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

Solution (Python):
print("Yes" if len(set(map(int, input().split()))) == 1 else "No")

Solution (Python):
import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)

def LI(): return list(map(int, stdin.readline().split()))
def LS(): return list(stdin.readline())

n,m = LI()
print('Yes' if n==m else 'No')

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

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

Solution (Python):
import sys
def ISI(): return map(int, sys.stdin.readline().rstrip().split())

n, m=ISI()
if(n==m):print("Yes")
else:print("No")

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

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

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

Solution (Python):
n, m = map(int, input().split())

if n == m:
  print('Yes')
  
else:
  print('No')

Solution (Python):
n, m = map(int, input().split())

if n == m:
    print('Yes')
else:
    print('No')

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

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

Solution (Python):
n, m = map(int, input().split())

if m >= n:
    print("Yes")
else:
    print('No')

Solution (Python):
import sys
input = sys.stdin.readline


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


if __name__ == '__main__':
    main()

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

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

Solution (Python):
N, M = map(int, input().split())

if N == M:
    print("Yes")
else:
    print("No")

Solution (Python):
N,M = map(int,input().split())

if N == M:
    print('Yes')
else:
    print('No')

Solution (Python):
N, M = map(int, input().split())
print('YNeos'[N!=M::2])

Solution (Python):




def input_int():
    return int(input())



def int1(x):
    return int(x) - 1



def input_to_int_map():
    return map(int, input().split())



def input_to_int_tuple():
    return tuple(map(int, input().split()))



def input_to_int_tuple_minus1():
    return tuple(map(int1, input().split()))


def main():
    n, m = input_to_int_map()

    ret = "No"
    if n == m:
        ret = "Yes"

    return ret


if __name__ == "__main__":
    print(main())

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

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

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

Solution (Python):
n,m=map(int,input().split())
if n==m:
    print("Yes")
else:
    print("No")

Solution (Python):
n, m = map(int, input().split())
if n==m:
    print("Yes")
else:
    print("No")

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

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

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

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

Solution (Python):
a= list(map(int,input().split()))
n=a[0]
m=a[1]
if n==m:
    print("Yes")
else:
    print("No")

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

Solution (Python):
n,m = (int(x) for x in input().split())

if n > m:
    print("No")
else:
    print("Yes")

Solution (Python):
n, m = map(int, input().split())
print("Yes" if n == m else "No")

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

Solution (Python):
N, M = list(map(int, input().split()))
if N==M:
    print("Yes")
else:
    print("No")

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

Solution (Python):
s,j= input().split()
if s==j:
    print("Yes")
else:
    print("No")

Solution (Python):
n,m=map(int,input().split())
print("Yes" if n<=m else "No")

Solution (Python):

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

Solution (Python):
from sys import stdin, setrecursionlimit


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


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

Solution (Python):
n,m = map(int, input().split())

if n == m :
	print("Yes")
else :
	print("No")

Solution (Python):

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

Solution (Python):
n,m=map(int,input().split())
if n==m:
  print("Yes")
else:
  print("No")

Solution (Python):


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

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

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

Solution (Python):
n,m=map(int,input().split())
if n==m:
  print("Yes"+"\n")
else:
  print("No"+"\n")

Solution (Python):
n,m=map(int,input().split())
if n==m:
  print("Yes")
else:
  print("No")

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

Solution (Python):
m,n=map(int,input().split())

if m==n:
    print('Yes')
else:
    print('No')

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

Solution (Python):
N, M = map(int, input().split())

if N > M:
    print("No")
else:
    print("Yes")

Solution (Python):

n, m = list(map(int, input().split()))

if n == m:
    print("Yes")
else:
    print("No")

Solution (Python):
n,m=map(int,input().split())
print("Yes"if m==n else "No")

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

Solution (Python):









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

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

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

Solution (Python):
N, M = map(int, input().split())


if N == M:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys
import math
import bisect

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

if __name__ == "__main__":
    main()

Solution (Python):
n,m=map(int,input().split())
if n==m:
    print("Yes")
else:
    print("No")

Solution (Python):
n, m = map(int, input().split())

if n == m:
    print("Yes")
else:
    print("No")

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

Solution (Python):
n, m = map(int, input().split())
print("Yes" if n == m else "No")

Solution (Python):
N, M = map(int, input().split())

if N == M:
    print("Yes")
else:
    print("No")

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

Solution (Python):
n,m = (int(i) for i in input().split())
print("Yes" if n==m else"No")

Solution (Python):
N, M = (int(x) for x in input().split())
print('Yes' if N==M else 'No')

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

Solution (Python):
n,m = map(int,input().split())
if (n==m):
  print("Yes")
else:
  print("No")

Solution (Python):
n,m = map(int,input().split())

if n==m:
    print("Yes")
else:
    print("No")

Solution (Python):
N,M = map(int, input().split())




print("Yes" if M == N else "No")

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

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

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

Solution (Python):
import fileinput

n, m = map(int, input().split())

if n == m:
    print("Yes")
else:
    print("No")

Solution (Python):
N, M = map(int, input().split())

if N == M:
    print("Yes")
else:
    print("No")

Solution (Python):
n,m=map(int,input().split())
if n==m:
  print("Yes")
else:
  print("No")

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

if __name__ == '__main__':

    ABC_152_A()

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

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

Solution (Python):
n, m = map(int, input().split())
if n == m:
    print("Yes")
else:
    print("No")

Solution (Python):
n,m=map(int,input().split())

if m==n:
    print("Yes")
else:
    print("No")

Solution (Python):

"""
Created on Sat May  9 01:29:25 2020

@author: shinba
"""

n,m = map(int,input().split())

if n == m:
    print("Yes")
else:
    print("No")

Solution (Python):
def solve():
    N, M = input().split()
    if N == M:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    solve()

Solution (Python):
def solve():
    N, M = map(int,input().split())
    if N == M:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    solve()

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

Solution (Python):
N,M = map(int, input().split())

if N == M:
    print("Yes")
else:
    print("No")

Solution (Python):
n, m = map(int, input().split())
if n == m:
  print("Yes")
else:
  print("No")

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

Solution (Python):
print("YNeos"[eval(input().replace(" ","!="))::2])

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

Solution (Python):
n, m = map(int, input().split())

if n == m:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys










stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
MIN = -10 ** 9
MOD = 10 ** 9 + 7
INF = float("inf")
IINF = 10 ** 18



n,m = map(int, stdin.readline().rstrip().split())


if n==m:
    print("Yes")
else:
    print("No")

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

Solution (Python):
n,m=map(int,input().split())

if n == m:
    print("Yes")
else:
    print("No")

Solution (Python):
n,m = map(int,input().split())

if n - m == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
N, M = map(int,input().split())

if N == M:
  print('Yes')
else:
  print('No')

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

Solution (Python):
n, m = map(int, input().split())
print("Yes" if n == m else "No")

Solution (Python):
il = [int(k) for k in input().split()]
if il[0] == il[1] :
    print("Yes")
else:
    print("No")

Solution (Python):
a,b=input().split()
if a==b:
    print("Yes")
else:
    print("No")

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

Solution (Python):
val = input().split()

N = int(val[0])
M = int(val[1])

if N - M == 0:
    print("Yes")
else:    
    print("No")

Solution (Python):
N,M=map(int,input().split())   
if N-M==0 :
    print("Yes")
else :
    print("No")

Solution (Python):
N, M = [int(x) for x in input().split()]
if N == M:
    print("Yes")
else:
    print("No")

Solution (Python):
n, m = map(int,input().split())
print("Yes") if n - m == 0 else print("No")

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

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

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

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

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

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

Solution (Python):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations, accumulate
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
import sys
def I(): return int(input())  
def Is(): return map(int, input().split())  
def LI(): return list(map(int, input().split()))  
def TI(): return tuple(map(int, input().split()))  
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()  
def LS(): return list(input())  
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(1000000)
MOD = 1000000007
INF = float('inf')

n, m = Is()
if n == m:
    print("Yes")
else:
    print("No")

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

Solution (Python):
n,m = map(int,input().split())
if n == m:
    print("Yes")
else:
    print("No")

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

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

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

Solution (Python):


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

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

Solution (Python):
N,M=input().split()
if N==M:
  print("Yes")
else:
  print("No")

Solution (Python):
N, M = map(int,input().split())
ans = "Yes" if N == M else "No"
print(ans)

Solution (Python):
n,m = list(map(int, input().split()))

if n == m:
    print('Yes')
else:
    print('No')

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

Solution (Python):
n, m = map(int, input().split())

if n == m:
    print("Yes")
else:
    print("No")

Solution (Python):

N, M = map(int, input().split())

print("Yes" if N == M else "No")

Solution (Python):
from sys import stdin


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


if __name__ == "__main__":
    main()

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

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

Solution (Python):
a, b = map(int, input().split())

if a == b:
    print('Yes')
else:
    print('No')

Solution (Python):
N, M = map(int, input().split())

if N == M:
    print("Yes")
else:
    print("No")

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

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

if __name__ == "__main__":
    main()

Solution (Python):
n, m = map(int, input().split())
print("Yes") if n==m else print("No")

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

Solution (Python):
N,M= map(int,input().split())

if N == M:
    print('Yes')

else :
    print('No')

Solution (Python):

A, B = map(int, input().split())

if A==B:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return map(int, sys.stdin.readline().split())
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i for i2 in range(j)]
def dp3(ini, i, j, k): return [[[ini]*i for i2 in range(j)] for i3 in range(k)]





N, M = mi()

if N == M:
    print('Yes')
else:
    print('No')

Solution (Python):
n,m=map(int,input().split())
if n==m:
    print("Yes")
else:
    print("No")