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):
import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")

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

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


"""
https://atcoder.jp/contests/abc152/tasks/abc152_a
AC or WA.
"""

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

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

    solve(n, m)

Solution (Python):
















































global FLAG_LOG
FLAG_LOG = False


def log(value):
    
    
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    
    
    N, M = list(map(int, lines[0].split()))
    
    
    
    
    
    
    
    

    if N == M:
        result = 'Yes'
    else:
        result = 'No'

    return [result]



def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines



def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['3 3']
        lines_export = ['Yes']
    if pattern == 2:
        lines_input = ['3 2']
        lines_export = ['No']
    if pattern == 3:
        lines_input = ['1 1']
        lines_export = ['Yes']
    return lines_input, lines_export



def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode



def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    
    
    
    
    
    
    
    
    
    
    



if __name__ == '__main__':
    main()

Solution (Python):
INPUT = list(input().split())
a = int(INPUT[0])
b = int(INPUT[1])

if a == b:
  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.buffer.readline
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))


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

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

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

elif n > m:
    print('No')

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

Solution (Python):

import collections as cl
import sys


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

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


main()

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

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

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

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

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

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,string
import numpy as np
import sys
sys.setrecursionlimit(10**7)

def _S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())


N,M= LI()





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

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

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

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

if not ( 1 <= N <= 100 and 0 <= M <= N ): sys.exit()
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 = 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 = 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):
A, B = map(int, input().split())

if (A == B):
  print("Yes")
else:
  print("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):

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()]
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('NYoe s'[N==M::2])

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=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):
import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))

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

Solution (Python):
import sys

def II(): return int(input())
def MI(): return map(int,input().split())
def LI(): return list(map(int,input().split()))
def TI(): return tuple(map(int,input().split()))
def RN(N): return [input().strip() for i in range(N)]


def main():
    N, M = MI()
    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())

ans = 'No'

if M == N:
  ans = 'Yes'

print(ans)

Solution (Python):
n,m = map(int,input().split())
print('Yes') if n == m 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(' '))
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 = input().split()
print('Yes') if n == m 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):
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):
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())
print("YNeos"[N!=M::2])

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

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

N,M=list(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):
x,y=map(int,input().split())
if x==y:
  print("Yes")
else:
  print("No")

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

if n[0] == n[1]:
    print("Yes")
else:
    print("No")

Solution (Python):
def main():

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

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

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

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










print("Yes" if n == k 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 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 = [int(x) for x 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):
def main():
  N,M = map(int, input().split())
  
  if N == M:
    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())
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
sys.setrecursionlimit(10**7)
input = sys.stdin.readline

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 copy
import random
import bisect 
import fractions 
import math
import sys
import collections
from decimal import Decimal 

mod = 10**9+7
sys.setrecursionlimit(mod) 

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))

N, M = LI()
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):
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):


import io
import sys
import math

def solve():
    
    pass

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

_DEB = 0   

_INPUT = """\
2 3
"""
_EXPECTED = """\
Yes
"""

def logd(str):
    """usage:
    if _DEB: logd(f"{str}")
    """
    if _DEB: print(f"[deb] {str}")


if __name__ == "__main__":
    if _DEB:
        sys.stdin = io.StringIO(_INPUT)
        print("!! Debug Mode !!")

    ans = main()

    if _DEB:
        print()
        if _EXPECTED.strip() == ans.strip(): print("!! Success !!")
        else: print(f"!! Failed... !!\nANSWER:   {ans}\nExpected: {_EXPECTED}")

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):
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")


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

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

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

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


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


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:
    ans = "Yes"
else:
    ans = "No"
print(ans)

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

Solution (Python):
n,m=input().split()
print("Yes" if n==m else "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())

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):
def main():
    import sys
    sys.setrecursionlimit(10**9)
    input = sys.stdin.readline

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

main()

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

Solution (Python):
a, b = map(int, input().split())
print(a == b and "Yes" or "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

def solve():
    
    n,m = map(int, stdin.readline().rstrip().split())
    
    
    
    
    
    if n==m:
        print("Yes")
    else:
        print("No")

if __name__ == '__main__':
    solve()

Solution (Python):

print("YNeos"[eval(input().replace(" ",">"))::2])

Solution (Python):
N, M = list(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):
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()
print('YNeos'[a!=b::2])

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

Solution (Python):
lst = input().split(' ')
m = lst[0]
n = lst[1]

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

Solution (Python):
x,y=input().split()
x=int(x)
y=int(y)



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

if n[0] == n[1]:
    print("Yes")
else:
    print("No")

Solution (Python):
from collections import defaultdict, deque
import sys, heapq, bisect, math, itertools, string, queue, copy, time
from fractions import gcd
import numpy as np
sys.setrecursionlimit(10**8)
INF = float('inf')
MOD = 10**9+7
EPS = 10**-7

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

print(ans)

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

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

Solution (Python):
if len(set((list(input().split()))))==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 M >= N:
  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 = 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):
n, m=map(int, input().split())
if n==m:
  print("Yes")
else:
  print("No")

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

fax = m == n

if fax: print("Yes")
else: print("No")

Solution (Python):
def main():
    a, b = map(int, input().split())
    if a == b:
        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=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 = 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):
import sys
sys.setrecursionlimit(10**7) 
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right

from collections import deque


from collections import Counter

from itertools import accumulate,combinations,permutations

from heapq import heapify,heappop,heappush


from functools import lru_cache

from decimal import Decimal

def input(): 
    x=sys.stdin.readline()
    return x[:-1] if x[-1]=="\n" else x
def printl(li): _=print(*li, sep="\n") if li else None
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds
def alp2num(c,cap=False): return ord(c)-97 if not cap else ord(c)-65
def num2alp(i,cap=False): return chr(i+97) if not cap else chr(i+65)
def matmat(A,B):
    K,N,M=len(B),len(A),len(B[0])
    return [[sum([(A[i][k]*B[k][j]) for k in range(K)]) for j in range(M)] for i in range(N)]
def matvec(M,v):
    N,size=len(v),len(M)
    return [sum([M[i][j]*v[j] for j in range(N)]) for i in range(size)]
def T(M):
    n,m=len(M),len(M[0])
    return [[M[j][i] for j in range(n)] for i in range(m)]
def main():
    mod = 1000000007
    

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

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

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

Solution (Python):
n , m = (int(a) for a in 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, readline().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("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):
x = [int(x) for x in input().split()]
if (x[0]==x[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 = 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().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()
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 fun():
    A = input("")
    return A

N = str(fun()).split(" ")
if (N[0] == N[1]):
    print("Yes")
    
else:
    print("No")

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

if __name__ == '__main__':
    solve()

Solution (Python):
a,b = input().split()
if b == a:
    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())
print('Yes') if m == n 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):
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 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 = 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  math
import fractions
from collections import defaultdict
stdin = sys.stdin
     
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))

N,M=nm()
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):
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=list(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())
print("YNeos"[n != m::2])

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

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