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

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

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

Solution (Python):
from bisect import bisect_right, bisect_left
from itertools import groupby, permutations, combinations
from fractions import gcd
import numpy as np
from sys import stdin, stderr


def lcm(x, y):
    return (x * y) // gcd(x, y)


def main():
    N, M = [int(x) for x in input().split()]
    ret = "Yes" if N == M else "No"
    return ret


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

import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline






















def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

def main():
	N,M = inputMap()

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

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

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

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

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

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

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

Solution (Python):

import sys
sys.setrecursionlimit(10**8)
input = sys.stdin.readline

n, m = [int(item) for item 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):

si = lambda: input()
ni = lambda: int(input())
nm = lambda: map(int, input().split())
snm = lambda: map(str, input().split())
nl = lambda: list(map(int, input().split()))
n,m=nm()
if m/n==1.0:
    print('Yes')
else:
    print('No')

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

    print(ans)

if __name__ == '__main__':
    main()

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

Solution (Python):

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

Solution (Python):
import sys
input = sys.stdin.readline
from operator import itemgetter
sys.setrecursionlimit(10000000)
INF = 10**30

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

if __name__ == '__main__':
    main()

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

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

Solution (Python):

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

Solution (Python):
import bisect

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

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

print(ans)

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

Solution (Python):
def read():
    N, M = list(map(int, input().strip().split()))
    return N, M

def solve(N, M):
    return 'Yes' if N == M else 'No'


if __name__ == '__main__':
    inputs = read()
    print("%s" % solve(*inputs))

Solution (Python):
import sys, re
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,copy
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 LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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


if __name__=='__main__':
    main()

Solution (Python):
def func():
    return



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



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

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

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

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

Solution (Python):

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

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

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

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

Solution (Python):
N, M = [int(x) for x in 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):
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 = 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())
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 is M:
    print('Yes')
else:
    print('No')

Solution (Python):
import sys
sys.setrecursionlimit(4100000)

import math

import logging

logging.basicConfig(level=logging.DEBUG)

logger = logging.getLogger(__name__)


def resolve():
    
    
    N, M = [int(x) for x in sys.stdin.readline().split()]  
    
    
    

    logger.debug('{}'.format([]))

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


if __name__ == "__main__":
    resolve()





import sys
from io import StringIO
import unittest


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """3 3"""
        output = """Yes"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """3 2"""
        output = """No"""
        self.assertIO(input, output)

    def test_入力例_3(self):
        input = """1 1"""
        output = """Yes"""
        self.assertIO(input, output)

Solution (Python):
import sys

read = sys.stdin.buffer.read
input = sys.stdin.buffer.readline
inputs = sys.stdin.buffer.readlines








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

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

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

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

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

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

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

H, W = map(int, input().split())

if H == W:
  print("Yes")
else:
  print("No")

Solution (Python):
from sys import stdin


def main():
    input = lambda: stdin.readline()[:-1]
    N, M = map(int, input().split())
    if N == M:
        print('Yes')
    else:
        print('No')


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

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

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

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

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

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

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

Solution (Python):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from bisect import bisect_right, bisect_left
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from copy import deepcopy
from math import factorial, ceil, floor, gamma, log
from operator import mul
from functools import reduce


sys.setrecursionlimit(2147483647)
INF = float('INF')
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 10 ** 9 + 7


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

Solution (Python):
inpl = lambda: 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:
    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
def input(): return sys.stdin.readline().rstrip()

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

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

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

Solution (Python):
import sys

n, m = map(int, sys.stdin.readline().split())

def main():
    return 'Yes' if n == m else ' No'

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

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

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

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

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

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


if __name__ == '__main__':
    main()

Solution (Python):

import re
import math


mod=int(10**9+7)


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,W=map(int,input().split())
if N==W:
    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):
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):
def main():
    from sys import stdin, setrecursionlimit
    
    
    
    
    
    
    
    a, b = map(int, input().split())
    
    

    cnt = 0
    if a-b == 0:
        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())
print('Yes' if n == m else 'No')

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

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

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

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

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

Solution (Python):
import itertools
from collections import deque,defaultdict,Counter
from itertools import accumulate
import bisect
from heapq import heappop,heappush
from fractions import gcd
from copy import deepcopy
import math
import queue


Mod = 1000000007
import sys

sys.setrecursionlimit(100000) 
  
def sieve_of_eratosthenes(n):
    if not isinstance(n,int):
        raise TypeError("n is not int")
    if n<2:
        raise ValueError("n is not effective")
    prime = [1]*(n+1)
    for i in range(2,int(math.sqrt(n))+1):
        if prime[i] == 1:
            for j in range(2*i,n+1):
                if j%i == 0:
                    prime[j] = 0
    res = []
    for i in range(2,n+1):
        if prime[i] == 1:
            res.append(i)
    return res

def factorial(i):
    if i == 1:
        return 1
    else:
        return i*factorial(i-1)
 
class UnionFind:
    def __init__(self,n):
        self.parent = [i for i in range(n+1)]
        self.rank = [0 for i in range(n+1)]
    
    def findroot(self,x):
        if x == self.parent[x]:
            return x
        else:
            y = self.parent[x]
            y = self.findroot(self.parent[x])
            return y
    
    def union(self,x,y):
        px = self.findroot(x)
        py = self.findroot(y)
        if px < py:
            self.parent[py] = px
        else:
            self.parent[px] = py
 
    def same_group_or_no(self,x,y):
        return self.findroot(x) == self.findroot(y)




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

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

Solution (Python):

from itertools import product, permutations, combinations
from bisect import bisect_right,bisect_left



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

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

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

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

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

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

Solution (Python):
N, M = list(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("No")
else:
  print("Yes")

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


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

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

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

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

Solution (Python):

import sys


def solve(inp):
    (N, M) = map(int, inp.readline().strip().split(' '))

    if N == M:
        return "Yes"
    else:
        return "No"


def main():
    result = solve(sys.stdin)
    if result:
        print(result)


if __name__ == '__main__':
    main()

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, 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
N, M = [int(v) for v 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):
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())
print("Yes" if a==b else "No")

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

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

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

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

Solution (Python):
n, m = map(int, input().split())
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
import math
stdin = sys.stdin
mod = 10**9 + 7

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
sa = lambda h: [list(map(int, stdin.readline().split())) for i in range(h)]


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

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)

N, M = map(int, read().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):
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 = [list(map(int, s.split())) for s in open(0)][0]
ans = 'Yes' if a == b else 'No'
print(ans)

Solution (Python):
n, m = map(str, 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):
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 = 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")