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):
aaa = input().split()
n, m = int(aaa[0]), int(aaa[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 = [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):
a = list(map(int, input().split()))

N = a[0]
M = a[1]

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= input().split()

if(a==b):
	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=(int(i) for i in 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):
I = input().split(' ')
N = int(I[0])
M = int(I[1])
 
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())

ans = "No"

if n == m:
  ans = "Yes"
 
print(ans)

Solution (Python):
N,M=[int(s) for s 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("Yes" if N == M else "No")

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

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

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

Solution (Python):




b, c = map(int, input().split())



if(c >= 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):

from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')


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


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

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

Solution (Python):
from fractions import gcd


import heapq
import math
from collections import defaultdict, Counter, deque
from bisect import *
import itertools
import fractions
import sys
sys.setrecursionlimit(10 ** 7)
MOD = 10 ** 9 + 7



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


def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    
    return divisors


def factorize(n):
    fct = []  
    b, e = 2, 0  
    while b * b <= n:
        while n % b == 0:
            n = n // b
            e = e + 1
        if e > 0:
            fct.append((b, e))
        b, e = b + 1, 0
    if n > 1:
        fct.append((n, 1))
    return fct


def is_prime(n):
    if n == 1:
        return False

    for k in range(2, int(math.sqrt(n)) + 1):
        if n % k == 0:
            return False

    return True


def primes(n):
    is_prime = [True] * (n + 1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n**0.5) + 1):
        if not is_prime[i]:
            continue
        for j in range(i * 2, n + 1, i):
            is_prime[j] = False
    return [i for i in range(n + 1) if is_prime[i]]

def modpow(a, n, mod):
    res = 1
    while n > 0:
        if n & 1:
            res = res * a % mod
        a = a * a % mod
        n >>= 1
    return res


def modinv(a, mod):
    return modpow(a, mod - 2, mod)


def cnk(a, b):
    MOD = 10**9+7
    ret = 1
    for i in range(b):
        ret *= (a-i)
        ret %= MOD
        ret = ret * modinv(i+1, MOD) % MOD
    return ret




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):
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 = input().split()
N = int(N)
M = 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):
input_list = list(map(int, input().split()))
testcase = input_list[0]
collect = input_list[1]
if testcase == collect:
  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 = m / n
if ans == 1:
	print("Yes")
else:
	print("No")

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

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

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

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

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

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

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

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

if N==M:
  print('Yes')
elif N<M:
  print('No')
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):
input_nm = input().split(' ')
if input_nm[0] == input_nm[1] :
  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()]
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):
s=input().split()
if s[0]==s[1]:
  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 = input().split()
if(int(n)==int(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


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


if __name__ == "__main__":
    main()

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

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=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):
input_  = input().split()
N = int(input_[0])
M = int(input_[1])

if M/N==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 = []
a = input().split()
N = int(a[0])
M = int(a[1])

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

Solution (Python):

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

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

Solution (Python):


a,b=map(int, input().split())

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

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

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

Solution (Python):
A, 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()
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):
num = [int(e) for e in input().split()]
A=num[0]
B=num[1]
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):
num = list(map(int, input().split()))
if 1 <= num[0] <= 100 and 0 <= num[1] <= num[0]:
    if num[0] <= num[1]:
        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):
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):
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):
nums = input().split()

A=int(nums[0])
B=int(nums[1])

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

Solution (Python):

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

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

result = input().split()

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

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

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

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

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

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

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

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

Solution (Python):


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


if __name__ == '__main__':
  main()

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

if N == M:
    print('Yes')
elif N < M:
    pass
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):
s = input().rstrip().split(' ')
case = int(s[0])
ans = int(s[1])
if case == ans:
    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):
A, P = map(int, input().split())

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

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

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

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

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

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

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

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

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

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

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

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

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

if test[0] == test[1]:
  print('Yes')

else:
  print('No')

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

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

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

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

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

Solution (Python):
def slove(n, m):

    if n == m :
        return "Yes"
    else:
        return "No"

if __name__ == "__main__":

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

    ans = slove(n, m)

    print(ans)

Solution (Python):

import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1

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

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

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

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

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

import sys
read = sys.stdin.readline


def read_ints():
    return list(map(int, read().split()))


def read_a_int():
    return int(read())


def read_matrix(H):
    '''
    H is number of rows
    '''
    return [list(map(int, read().split())) for _ in range(H)]


def read_map(H):
    '''
    H is number of rows
    文字列で与えられた盤面を読み取る用
    '''
    return [read()[:-1] for _ in range(H)]


def read_col(H, n_cols):
    '''
    H is number of rows
    n_cols is number of cols

    A列、B列が与えられるようなとき
    '''
    ret = [[] for _ in range(n_cols)]
    for _ in range(H):
        tmp = list(map(int, read().split()))
        for col in range(n_cols):
            ret[col].append(tmp[col])

    return ret


N, M = read_ints()

print(('Yes', 'No')[N != M])

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

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

Solution (Python):
def slove(n, m):

    if n == m :
        return "Yes"
    else:
        return "No"

if __name__ == "__main__":

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

    ans = slove(n, m)

    print(ans)

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

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

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

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

Solution (Python):
N, M = [int(i) for i in 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):
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 M < N:
  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 '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())
ret='Yes' if a==b else 'No'
print(ret)

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

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

Solution (Python):


"""
oj dl https://atcoder.jp/contests/abc116/tasks/abc116_d -d test-d
oj test -d test-d -c "python abc116d.py"
oj test -d test-d -c "python abc116d.py" test-d/sample-3.in
"""
from collections import defaultdict
import sys
import math
from datetime import datetime

def sol(a, b):
    return "Yes" if a == b else "No"
    
    



do_submit = True


def input_parse(input_str):
    lines = [x.strip() for x in input_str.split("\n") if x.strip()]
    parsed_lines = [list(map(str, line.split())) for line in lines]
    print(parsed_lines)
    n = int(parsed_lines[0][0])
    k = int(parsed_lines[0][1])
    S = parsed_lines[1][0]
    return n, k, S


if not do_submit:
    a, b, c = input_parse("""
    3 1
    ABC
    """)
    print(sol(a, b, c))

    a, b, c = input_parse("""
    4 3
    CABA
    """)
    print(sol(a, b, c))

else:
    a, b = list(map(int, input().split()))
    
    
    
    
    print(sol(a, b))

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

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

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

Solution (Python):

import sys
from fractions import gcd
from string import ascii_lowercase as ABC

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

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

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

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

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

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

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

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

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

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

if (type(n)==int) and (type(n)==int) and (1<=n) and (n<=100) and (m<=n):
    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):


import sys
import math


debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        
        
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]

    (n, m) = [int(e) for e in lines[0].split(" ")]

    return (n, m)


def solve(n, m):

    result = 'No'
    if n == m:
        result = 'Yes'
    return result
    


def main():
    
    result = solve(*parse_input())
    if isinstance(result, list):
        for r in result:
            print("%s" % r, sep='')
    else:
        print("%s" % result, sep='')

if __name__ == '__main__':

    main()

Solution (Python):

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

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

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

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

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

Solution (Python):
F = [int(f) for f in input().split()]
N = F[0]
M = F[1]
if(N == M):
    print("Yes")
else:
    print("No")

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




"""
このプログラムはPythonを書く際のテンプレとなっています。これをコピペしてコーディングを行なってください。
なお字下げしないこと！！
"""

__author_ = 'Maruta Yuzuha'
__version_ = '1.0.0'
__date__ = '2019/12/25'

def main():
    """
    ここでプログラムの解説を行う
     >>main()
    Hello world.
    0
    """
    s = input().split()
    if (s[0] == s[1]) and int(s[0]) <= 100 and int(s[0]) >= 0:
        print('Yes')
    else: 
        print('No')
    
    return 0

if __name__ == '__main__':
    
    

    
    
    import doctest
    doctest.testmod()

    
    import sys
    sys.exit(main())

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

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

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

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

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

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

Solution (Python):
import unittest


class TestA(unittest.TestCase):
    def test_1(self):
        self.assertEqual(think(3, 3), 'Yes')

    def test_2(self):
        self.assertEqual(think(3, 2), 'No')


def solve():
    n, m = read()
    result = think(n, m)
    write(result)


def read():
    return read_int(2)


def read_int(n):
    return read_type(int, n, sep=' ')


def read_float(n):
    return read_type(float, n, sep=' ')


def read_type(t, n, sep):
    return list(map(lambda x: t(x), read_line().split(sep)))[:n]


def read_line(n=0):
    if n == 0:
        return input().rstrip()
    else:
        return input().rstrip()[:n]


def think(n, m):
    if n == m:
        return 'Yes'
    return 'No'


def write(result):
    print(result)


if __name__ == '__main__':
    
    solve()

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

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

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

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

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

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

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

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

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

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

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

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

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