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):
a,b=map(int,input().split())
if a==b:
  print('Yes')
else:
  print('No')

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

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):
import sys
input = sys.stdin.readline

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

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):
s = list(map(int,input().split()))
if s[0] == s[1]:
    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 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):
input = input().rstrip().split()
print("Yes" if input[0] == input[1] 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):
def main():
  a,b = map(int,input().split())
  ans = check(a,b)
  print(ans)
  
def check(n,m):
  if n == m:
    return "Yes"
  else:
    return "No"
main()

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())
print("No" if N!=M else "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):
a,b = map(int,input().split())
if a == b:
  print('Yes')
else:
  print('No')

Solution (Python):
import sys
import socket

hostname = socket.gethostname()

if hostname == 'F451C':
    sys.stdin = open('a1.in')


def read_int_list():
    return list(map(int, input().split()))


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


def main():
    n, m = read_int_list()
    if n > m:
      res = 'No'
    else:
      res = 'Yes'
    print(res)


main()

Solution (Python):

 
s = input().split()
if s[0]==s[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 = 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):
N, M = map(int, input().split())
if N == M:
    print("Yes")
else:
    print("No")

Solution (Python):



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

if __name__=='__main__':
  main()

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

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

Solution (Python):


n,m = 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):

import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n,m = map(int,read().split())
if n == m: print("Yes")
else: print("No")

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

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

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

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

Solution (Python):
print('Yes' if eval(input().replace(' ','==')) else '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):
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):
s,t=map(int,input().split())
if s==t:
    print("Yes")
else:
    print("No")

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

Solution (Python):
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations,groupby
import sys
import bisect
import string
import math
import time
import random
def S_():
    return input()
def LS():
    return [i for i in input().split()]
def I():
    return int(input())
def MI():
    return map(int,input().split())
def LI():
    return [int(i) for i in input().split()]
def LI_():
    return [int(i)-1 for i in input().split()]
def NI(n):
    return [int(input()) for i in range(n)]
def NI_(n):
    return [int(input())-1 for i in range(n)]
def StoI():
    return [ord(i)-97 for i in input()]
def ItoS(nn):
    return chr(nn+97)
def LtoS(ls):
    return ''.join([chr(i+97) for i in ls])
def GI(V,E,Directed=False,index=0):
    org_inp=[]
    g=[[] for i in range(n)]
    for i in range(E):
        inp=LI()
        org_inp.append(inp)
        if index==0:
            inp[0]-=1
            inp[1]-=1
        if len(inp)==2:
            a,b=inp
            g[a].append(b)
            if not Directed:
                g[b].append(a)
        elif len(inp)==3:
            a,b,c=inp
            aa=(inp[0],inp[2])
            bb=(inp[1],inp[2])
            g[a].append(bb)
            if not Directed:
                g[b].append(aa)
    return g,org_inp
def bit_combination(k,n=2):
    rt=[]
    for tb in range(n**k):
        s=[tb//(n**bt)%n for bt in range(k)]
        rt+=[s]
    return rt
def show(*inp,end='\n'):
    if show_flg:
        print(*inp,end=end)
YN=['Yes','No']
mo=10**9+7
inf=float('inf')
l_alp=string.ascii_lowercase
u_alp=string.ascii_uppercase
ts=time.time()
sys.setrecursionlimit(10**5)
input=lambda: sys.stdin.readline().rstrip()

def ran_input():
    import random
    n=random.randint(4,16)
    rmin,rmax=1,10
    a=[random.randint(rmin,rmax) for _ in range(n)]
    return n,a

show_flg=False
show_flg=True

ans=0


ans=0

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

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())
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):
print("Yes" if len(set(input().split())) == 1 else "No")

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

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

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

Solution (Python):

n,m=input().split()
ans="No"
if n==m:
    ans="Yes"
print(ans)

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):
nm=input().split()
n=nm[0]
m=nm[1]
if n==m:
    print("Yes")
else:
    print("No")

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

Solution (Python):
a,b = map(int,input().split())
if (a==b):
    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())

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

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

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

Solution (Python):
print(" YNeos"[len(set(input().split()))::2])

Solution (Python):
print("YNeos"[len(set(input().split()))>1::2])

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

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 = list(map(int,input().split()))

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

Solution (Python):
tsc, ps = map(int, input().split())
ans = "No"
if tsc == ps:
  ans = "Yes"
print(ans)

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):
a=input()
b=a.split()
if int(b[0])==int(b[1]):
  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 = input().split()
if n == m:
  print('Yes')
else:
  print('No')

Solution (Python):

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


if __name__ == "__main__":
    main()

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

Solution (Python):
a,b=input().split()
print('Yes' if a == b 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 'No')

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

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

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

if M == N:
  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())
if n == m:
  print('Yes')
else:
  print('No')

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

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

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

Solution (Python):
n,m=[i for i in input().split()]
print('Yes' if n==m 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):
a, b = 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,c = map(int,input().split())

print("Yes") if a==c else print("No")

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

Solution (Python):
a = [int(x) for x in input().split()]
if a[0] == a[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 = list(map(int,input().split()))
a = 'No'
if n==m:
  a = 'Yes'
print(a)

Solution (Python):
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): 
    return list(map(int,input().split()))
def m(): 
    return map(int,input().split())
def onem(): 
    return int(input())
def s(x): 
    a = []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): 
    return " ".join(map(str,x))
def max2(x): 
    return max(map(max,x))
def In(x,a): 
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False
"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""

n,m = m()

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


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    n, m = list(map(int, input().rstrip('\n').split()))
    if n == m:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    solve()

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

Solution (Python):
def solve(string):
    n, m = map(int, string.split())
    return "Yes" if n == m else "No"


if __name__ == '__main__':
    import sys
    print(solve(sys.stdin.read().strip()))

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):
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 = [int(i) for i 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())
ans = "Yes" if n == m else "No"
print(ans)

Solution (Python):
a = input()
l = a.split()
n = int(l[0])
m = 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):
l=list(map(int, input().split()))
print("Yes" if l[0] == l[1] else "No")

Solution (Python):
n,m=input().split()
n,m=int(n),int(m)
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):
from sys import stdin
a, b = stdin.readline().rstrip().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):
n,m=map(int,input().split())
print("Yes" if n==m else "No")

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

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

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

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

Solution (Python):


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

Solution (Python):
def main(n, m):
    if n == m:
        print('Yes')
    else:
        print('No')


if __name__ == "__main__":
    n, m = map(int, input().split())

    main(n, m)

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):
import queue as Q

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):
def solve(n, m):
    return "Yes" if n == m else "No"

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

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):
a, b = map(int, input().split())
if (a == b):
    print("Yes");
else:
    print("No");

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

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

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

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

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

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

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

if M >= N:
    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):
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):
b,c=map(int,input().split())


if b==c:
    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 n == m:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    main()

Solution (Python):
def wczytaj_liste(): 
    wczytana_lista = input()
    lista_znakow = wczytana_lista.split()
    ostateczna_lista = []
    for element in lista_znakow:
        ostateczna_lista.append(int(element))
    return ostateczna_lista 

def AC_WC():
    N, M = wczytaj_liste()
    if N == M: 
        print('Yes')
    else: 
        print('No')
        
AC_WC()

Solution (Python):
a, b = [int(x) for x in input().split()]
print(["No", "Yes"][a == b])

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):
n,m=map(int,input().split())
if n==m:
  print('Yes')
else:
  print('No')

Solution (Python):

import sys
sys.setrecursionlimit(10000000)
INF = 1<<32

YES = "Yes"  
NO = "No"  

def solve(N: int, M: int):
    if N==M:
        print(YES)
    else:
        print(NO)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    M = int(next(tokens))  
    solve(N, M)

if __name__ == '__main__':
    main()

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

Solution (Python):
a,b=map(int,input().split())
if b<a:
	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, raw_input().split())
print 'Yes' if n == m else 'No'

Solution (Python):
import math as mt
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 = 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):
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] = map(int, input().split())

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

Solution (Python):
def acinput():
    return list(map(int, input().split(" ")))



import numpy as np

import math
import string
import itertools
import fractions
import heapq
import collections
import re
import array
import bisect
import sys
import random
import time
import copy
import functools

N,M=acinput()

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=input().split();print('YNeos'[a!=b::2])

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

Solution (Python):
N, M = [int(j) for j in 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
import math
import itertools
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):
L, R = input().split()

if L == R:
  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):
a, b = input().split()
a = int(a)
b = int(b)
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):
def acinput():
    return list(map(int, input().split(" ")))


N,M=acinput()

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=map(int,input().split())
if n==m:
  print('Yes')
else:
  print('No')

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

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

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

Solution (Python):
input = input().split(" ")
if input[0] == input[1]:
  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):
M,N = list(map(int, input().split()))
if M==N:
  print('Yes')
else:
  print('No')

Solution (Python):
n,m=[int(i) for i in 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 = list(map(int,input().split()))
if n == m:
  print("Yes")
else:
  print("No")

Solution (Python):
def main():
    x, y = map(int, input().split(' '))
    if y >= x:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Solution (Python):
N, M = 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, A = input().split() 
Num = int(N)
Num1 = int(A)
if (N == A):
  print("Yes")
else:
  print("No")

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

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())

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

Solution (Python):
N, M = map(int, input().rstrip().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 = list(map(int, input().split()))

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

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

Solution (Python):

N, M = map(int, 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):
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):
i = list(map(int, input().split()))
if i[0] == i[1]:
    print('Yes')
else:
    print("No")

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

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

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

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

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

Solution (Python):
i = list(map(int, input().split()))
if i[0]==i[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 = 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 = [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):
I,U = input().split()
print("Yes" if I==U 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 = list(map(int, input().split()))

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

Solution (Python):
a, b = list(map(int, 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 = 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):
N,M = map(int,input().split())

if M==N:
    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 = 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 == 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 = 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):
a = list(map(int,input().split()))

if a[0] == a[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 = (int(nm) for nm in 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 sys import stdin
lines = stdin.readlines()
 
N, M = map(int, lines[0].split())

if N == M:
  print("Yes")
elif N > M:
  print("No")
elif N < M:
  print("Yes")

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

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

Solution (Python):
str1, str2 = [s for s in input().split()]
if str1 == str2:
    print('Yes')
else:
    print('No')

Solution (Python):
N,M=map(int,input().split())
if M == N:
    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):
def main():
  N, M = map(int, input().split())
  print('Yes') if N == M else print('No')

if __name__ == '__main__':
  main()

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