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 math
import numpy as np
from fractions import gcd
import fractions
import statistics
import collections
from functools import reduce
import itertools
from collections import defaultdict
import bisect
from fractions import Fraction
 
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 = 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 = map(int, input().split())

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

Solution (Python):
N, M = [int(n) for n 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())
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):
import sys
import math
from collections import deque
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):
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):
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(["No","Yes"][N==M])

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

Solution (Python):

import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(100000)
input = sys.stdin.readline
INF = 2**62-1

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


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


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(N, M):
    return 'Yes' if N == M else 'No'


def main():
    N, M = read_int_n()
    print(slv(N, M))


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

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


from collections import deque, defaultdict
import itertools as ite
import sys
import math
from decimal import *

sys.setrecursionlimit(1000000)

INF = 10 ** 18
MOD = 10 ** 9 + 7

N, M = map(int, raw_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):
from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate
import sys
import bisect
import string
import math
import time


def I(): return int(input())


def S(): return input()


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


def MS(): return map(str, input().split())


def LI(): return [int(i) for i in input().split()]


def LI_(): return [int(i)-1 for i in input().split()]


def StoI(): return [ord(i)-97 for i in input()]


def ItoS(nn): return chr(nn+97)


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


def show(*inp, end='\n'):
    if show_flg:
        print(*inp, end=end)


YN = ['No', 'Yes']
MOD = 10**9+7
inf = float('inf')
IINF = 10**10
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**6)
nums = ['1', '2', '3', '4', '5', '6', '7', '8', '9', '10']

show_flg = False



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())
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 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
n, m = [int(i) for i in sys.stdin.readline().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(raw_input().split()))==1 else "No"

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

Solution (Python):



def ri():
    return int(input())

def rl():
    return list(input().split())

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

def main():
    n, m = rli()
    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):
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):
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):
from operator import itemgetter
from math import log,ceil

def main():

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


if __name__ == "__main__":
    main()

Solution (Python):
import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)

def s(generator, splitter, mapper):
    return [ mapper(s) for s in generator().split(splitter) ]


def get_nums_l():
    return [ int(s) for s in input().split(" ")]


def get_nums_n(n):
    return [ int(input()) for _ in range(n)]

n,m = get_nums_l()

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):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
 
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

a, b = MAP()
if a== b :
    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 heapq
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y): return pow(x, y, DVSR)
def INV(x, m=DVSR): return pow(x, m - 2, m)
def DIV(x, y, m=DVSR): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()
def II(): return int(input())
def FLIST(n):
    res = [1]
    for i in range(1, n+1): res.append(res[i-1]*i%DVSR)
    return res
def gcd(x, y):
    if x < y: x, y = y, x
    div = x % y
    while div != 0:
        x, y = y, div
        div = x % y
    return y

N,M=LI()
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):
def examA():
    N, M = LI()
    if N==M:
        print("Yes")
    else:
        print("No")
    return

def examB():
    ans = 0
    print(ans)
    return

def examC():
    ans = 0
    print(ans)
    return

def examD():
    ans = 0
    print(ans)
    return

def examE():
    ans = 0
    print(ans)
    return

def examF():
    ans = 0
    print(ans)
    return

import sys,copy,bisect,itertools,heapq,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
alphabet = [chr(ord('a') + i) for i in range(26)]

if __name__ == '__main__':
    examA()

"""

"""

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):
n,m = map(int, input().split())
ans = "Yes"
if n != m:
    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().split())

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

Solution (Python):
import sys

def get_ints(): return map(int, sys.stdin.readline().strip().split())
def get_array(): return list(map(int, sys.stdin.readline().strip().split()))

n,m = get_ints()
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):
inputs = input().split(" ")
n = int(inputs[0])
m = int(inputs[1])
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):
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):
import math
import fractions
import bisect
import collections
import itertools
import heapq
import string
import sys
import copy
from collections import deque
sys.setrecursionlimit(10**7)
def gcd(a,b):return fractions.gcd(a,b) 
def lcm(a,b):return (a*b) // fractions.gcd(a,b) 
def iin(): return int(input()) 
def isn(): return input().split() 
def imn(): return map(int, input().split()) 
def iln(): return list(map(int, input().split())) 
def iln_s(): return sorted(iln()) 
def iln_r(): return sorted(iln(), reverse=True) 
def join(l, s=''): return s.join(l) 
def perm(l, n): return itertools.permutations(l, n) 
def perm_count(n, r): return math.factorial(n) // math.factorial(n-r) 
def comb(l, n): return itertools.combinations(l, n) 
def comb_count(n, r): return math.factorial(n) // (math.factorial(n-r) * math.factorial(r)) 
def two_distance(a, b, c, d): return ((c-a)**2 + (d-b)**2)**.5 

N,M = imn()

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

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())
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('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):
import sys
def input():
    return sys.stdin.readline()[:-1]
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):
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 = map(int, input().split())

ans = 'Yes' if N == M else 'No'

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

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

Solution (Python):
N,M = [int(n) for n 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 = 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):






import math
import statistics
import numpy as np
import queue


def fact(n):
  if(n == 1):
    return 1
  else:
    return (n * fact(n - 1))


def gcd(a,b):
  if a == 0:
    return b
  elif b == 0:
    return a
  else:
    return gcd(b,a % b)


def lcm(a,b):
  return (a * b / gcd(a,b))


def qsort(seq):
  if len(seq) < 2:
    return seq
  else:
    beg, end = 0, len(seq) - 1
    mid = (beg + end) // 2
    smaller = [c for c in seq if seq[mid] > c]
    equal = [c for c in seq if seq[mid] == c]
    larger = [c for c in seq if seq[mid] < c]
    return (qsort(smaller) + equal + qsort(larger)) 






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):
import sys







def main():
    N, M = map(int, input().split())
    if M >= N:
        ans = 'Yes'
    else:
        ans = 'No'

    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):

from fractions import gcd
import math

from math import factorial as f

from math import ceil,floor,sqrt


import bisect
import re
import heapq


from copy import deepcopy
import itertools

from sys import exit

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

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




main()

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


main()

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

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

Solution (Python):
A, B = map(int, input().split())
print("YNeos"[not(A==B)::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):
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):
A,B=map(int,input().split())
print("Yes" if A==B else "No")

Solution (Python):
m,n = 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())
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 input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7

N, M = MAP()

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

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

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

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
 


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

Solution (Python):
import collections
import math
import operator as op
from functools import reduce
import numpy as np
import math
import bisect
import heapq


def gcd(a, b):
    while b:
        a, b = b, a % b
    return a


def lcm(a, b):
    return a * b // gcd(a, b)


def get_inputs(cast_func=None):
    if cast_func is None:
        return input().split()
    else:
        return list(map(cast_func, input().split()))


def get_input(cast_func=None):
    if cast_func is None:
        return input()
    else:
        return cast_func(input())


def is_prime(n):
    if n == 1:
        return False
    for i in range(2, int(n**0.5)+1):
        if n % i == 0:
            return False
    return True


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

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

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

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

Solution (Python):
def two_int():
    N, K = map(int, input().split())
    return N,K

def one_int():
    return int(input())

def one_str():
    return input()

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

N,M = two_int()

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

Solution (Python):
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())

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):
def main():
    n, m = map(int, input().split())

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


if __name__ == '__main__':
    main()

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=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 = 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):
import sys

input = sys.stdin.readline


def main():
    N, M = [int(x) for x in 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 N == M:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys
input = sys.stdin.readline
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, h = map(int, input().split())
if n == h:
  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):
import sys
import math
input = sys.stdin.readline


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 = 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:
        return "Yes"
    return "No"

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 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):
import math
import itertools
import fractions
import heapq
import collections
import bisect
import sys

sys.setrecursionlimit(10**9)
mod = 998244353
inf = 10**20

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()

n,m = LI()

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

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

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

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

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

Solution (Python):

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

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