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

Solution (Python):
import math

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

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

Solution (Python):
s = input().split()
n = int(s[0])
m = int(s[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):
n,m=map(int,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())
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 = [ 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):
def read_ints(row):
    return list(map(int, row().split()))
  
import sys
 
row =sys.stdin.readline
N,M = read_ints(row)
print("Yes" if N == M else "No")

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

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

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

print('No')

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

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

if y[0]==y[1]:
    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()
if (N==M):
    print("Yes")
else:
    print("No")

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

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

Solution (Python):

def sRaw():
    return input().rstrip("\r")


def iRaw():
    return int(input())


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


def isRaw():
    return list(map(int, ssRaw()))

INF = 1 << 29

DIV = (10**9) + 7

def mod_inv_prime(a, mod=DIV):
    return pow(a, mod-2, mod)

def mod_inv(a, b):
    r = a
    w = b
    u = 1
    v = 0
    while w != 0:
        t = r//w
        r -= t*w
        r, w = w, r
        u -= t*v
        u, v = v, u
    return (u % b+b) % b


def CONV_TBL(max,mod=DIV):
    fac,finv,inv = [0]*max, [0]*max, [0]*max
    fac[0]=fac[1]=1
    finv[0]=finv[1]=1
    inv[1]=1
    for i in range(2,max):
        fac[i] = fac[i-1]*i % mod
        inv[i] = mod -inv[mod%i] * (mod//i)%mod
        finv[i] = finv[i-1]*inv[i]%mod
    class CONV:
        def __init__(self):
            pass
        def ncr(self,n,k):
            if(n<k):
                return 0
            if(n<0 or k<0 ):
                return 0
            return fac[n]*(finv[k]*finv[n-k]%mod)%mod
    return CONV()



def main():
    N,M =isRaw()
    return "Yes" if N==M else "No"


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

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

Solution (Python):

class Solution:
    def solve(self, n, m):
        return n == m


sol = Solution()

[n, m] = list(map(int, input().strip().split(" ")))

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

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

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

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

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

Solution (Python):
a,b = 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):


TestCaseNum, ACNum = map(lambda x: int(x), input().split())
if TestCaseNum==ACNum:
    print("Yes")
else:
    print("No")

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

Solution (Python):

N, M = tuple(input().split())

if M == N:
    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):
num = list(input().split())

if num[0] == num[1]:
    print('Yes')
else :
    print('No')

Solution (Python):
from sys import stdin
def solve():
  n,m=map(int,stdin.readline().split())
  if n==m:
    print('Yes')
  else:
    print('No')
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:
  result = 'Yes'
else:
  result = 'No'
print(result)

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

Solution (Python):

class Solution:
    def solve(self, N: int, M: int) -> str:
        if N == M:
            return 'Yes'
        else:
            return 'No'


if __name__ == '__main__':

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

    
    solution = Solution()
    print(solution.solve(N, M))

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

Solution (Python):
a,b=input().strip().split(" ")
a,b=[int(a),int(b)]
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("Yes" if n == m else "No")

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

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

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

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

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

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

ans = 'No'
if a == b:
    ans = 'Yes'

print(ans)

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

Solution (Python):

from sys import stdin




def _li(): return list(map(int, stdin.readline().split()))
def _li_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def _lf(): return list(map(float, stdin.readline().split()))
def _ls(): return stdin.readline().split()
def _i(): return int(stdin.readline())
def _f(): return float(stdin.readline())
def _s(): return stdin.readline()[:-1]


N, M = _li()
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):
val = input().split()    
if val[0]==val[1]:    
    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 = (int(i) for i in input().split())
  if n == m:
    print("Yes")
  else:
    print("No")
solve()

Solution (Python):


"""
name: 152A.py
プログラムの説明
"""

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

if __name__ == '__main__':
    main()

Solution (Python):
def check_winner(N, M):
    if N == M:
        return "Yes"
    return "No"

if __name__ == "__main__":
    test1 = "3 3"
    test2 = "3 2"
    test3 = "5 0"
    test = test3
    test_input = map(int, input().split())
    print(check_winner(*test_input))

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

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

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

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

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

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

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

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

print(ans)

Solution (Python):

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

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):
n, m = list(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, 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(' ')
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):
import sys
a, b = [int(x) for x in sys.stdin.readline().rstrip('\n').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 = input().split()
N = int(n)
M = int(m)
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):
n, m = map(int, input().split())
if n == m:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys
import os





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

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

Solution (Python):
import sys
from operator import itemgetter
import collections


def main():
    input = sys.stdin.readline
    s, n = map(int, input().split())
    print("Yes" if s==n else "No")

    
if __name__ == '__main__':
    main()

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

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

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

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

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

Solution (Python):
ls = [int(i) for i in input().split()]

if ls[0] == ls[1]:
  print('Yes')
else :
  print('No')

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


if __name__ == '__main__':
    n, m = input().split()
    main(n, m)

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

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

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

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

Solution (Python):
def main():
    from sys import stdin, setrecursionlimit
    
    
    r = stdin.readline()[:-1]
    
    
    
    
    
    a = list(map(int, r.split()))
    
    
    
    

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

if __name__ == '__main__':
    main()

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

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

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

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

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

Solution (Python):
In = input().split(" ")
N = int(In[0])
M = int(In[1])

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

Solution (Python):
S = input()
S = S.split(" ")
N = S[0]
M = S[1]

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

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

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

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

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

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

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

if __name__ == '__main__' :
	main()

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

Solution (Python):
import sys
n, m = [int (e) for e in sys.stdin.readlines()[0].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 = 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):
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")
elif N > M:
    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")
elif N > M:
    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 and a>0):
  print('Yes')
else:
  print('No')

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

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

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

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

Solution (Python):
a = 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 = input().split()

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

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

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 = list(map(int, input().split()))
if a[0] == a[1]:
    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):
Input = input().split()

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

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

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

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

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

print('Yes') if(N == M) 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()

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

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

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

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

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

Solution (Python):

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

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

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

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 test_cases(cases: list) -> str:
	if cases[0] == cases[1]:
		return "Yes"
	return "No"

case = input()
cases = case.split()
print(test_cases(cases))

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

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

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

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

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

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

Solution (Python):
i,j = map(int, input().split())

if i == j:
  print("Yes")
else:
  print("No")

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

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

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

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

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

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

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

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

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

Solution (Python):
N_M = input().split() 
N = int(N_M[0])
M = int(N_M[1])

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

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

Solution (Python):

import sys

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=raw_input()
m=a.split()
N,M=map(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):
print("YNeos"[(len(set(input().split()))>1)::2])

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
a=set(input().split());print("YNeos"[len(a)-1::2])

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

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

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

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

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

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

Solution (Python):
input_line = input()

qwestion,answer = input_line.split()

judge = 'Yes'

if qwestion != answer:
    judge = 'No'
    
print(judge)

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

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

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

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

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

Solution (Python):
r,t = input().split()
if r == t:
  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())

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

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

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

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

print("Yes") if a == b 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):


import sys
sys.setrecursionlimit(300000)

YES = "Yes"  
NO = "No"  

def solve(N: int, M: int):
    if N == M:
        ret = YES
    else:
        ret = NO
    print(ret)
    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):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
mod2 = 998244353
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

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()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)


def main():
    n,m = LI()
    if n == m:
        return 'Yes'

    return 'No'


print(main())

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

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

Solution (Python):
n, m = list(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())
ans = 'No'
if(N==M):ans='Yes'
print(ans)

Solution (Python):

n, m = list(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):
from sys import stdin
N, M = [int(_) for _ in stdin.readline().rstrip().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 = list(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())
if n==m:
    print("Yes")
else:
    print("No")

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

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