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

import sys

YES = "Yes"  
NO = "No"  


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

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



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

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

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

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

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

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

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

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

Solution (Python):



import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys

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

Solution (Python):

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

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

Solution (Python):

import sys
input = sys.stdin.buffer.readline


from collections import defaultdict


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


def main():
	N, M = getlist()
	if N == M:
		print("Yes")
	else:
		print("No")


if __name__ == '__main__':
	main()

Solution (Python):
import sys
sys.setrecursionlimit(1000000000)
import math
from fractions import gcd
from itertools import count, permutations
from functools import lru_cache
from collections import deque, defaultdict
from pprint import pprint
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
N1097 = 10**9 + 7

def meg(f, ok, ng):
    while abs(ok-ng)>1:
        mid = (ok+ng)//2
        if f(mid):
            ok=mid
        else:
            ng=mid
    return ok


def main():
    N,M=mis()
    print('Yes' if N==M else 'No')


main()

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

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

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

Solution (Python):

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

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

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

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

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

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

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

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

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


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

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

Solution (Python):


import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

n,m = LI()

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

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

Solution (Python):
from collections import Counter,defaultdict,deque
import sys
import bisect
import math
import itertools
import string
import queue
import copy


from itertools import permutations, combinations
from heapq import heappop, heappush

sys.setrecursionlimit(10**8)
mod = 10**9+7
 
def inp(): 
    return int(input())
def inpm(): 
    return map(int,input().split())
def inpl(): 
    return list(map(int, input().split()))
def inpls(): 
    return list(input().split())
def inplm(n): 
    return list(int(input()) for _ in range(n))
def inpll(n): 
    return [list(map(int, input().split())) for _ in range(n)]


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

if x==y:
    print("Yes")
else:
    print("No")

Solution (Python):

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

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

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

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

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

Solution (Python):

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


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

Solution (Python):
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def my_round(a,dig=0): 
    p = 10 ** dig
    return (a * p * 2 + 1) // 2 / p

def round_up(a): 
    return int(a + 0.9)

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

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

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

def is_prime(a): 
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): 
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def prime_fact(a): 
    sqrt = math.sqrt(a)
    res = []
    i = 2
    if is_prime(a):
        res.append(a)
    else:
        while a!=1:
            while a%i==0:
                res.append(i)
                a //= i
            i += 1
    return res

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

if __name__=='__main__':
    main()

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

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

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

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

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

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

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


if __name__ == '__main__':
    main()

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

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

Solution (Python):
n,m=map(int,input().split())
if n==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 Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,pprint,fractions
sys.setrecursionlimit(10**8)
mod = 10**9+7
mod2 = 998244353
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

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

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 accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop

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

N, M = MAP()

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

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

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

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

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

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

Solution (Python):
import sys
input=sys.stdin.readline
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))

n,m=MAP()

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):
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):
def main():
    a, b = map(int, raw_input().split())
    if a == b:
        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())
if N==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 print("No")

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

Solution (Python):
import sys
import fractions
import math
MAX_INT = int(10e12)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

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

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

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

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

Solution (Python):

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

Solution (Python):
N, M = map(int, input().split())
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 = tuple(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= 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):
n, m = [int(i) for i in input().split()]
if n == m:
    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):



def main():
    import sys
    input = sys.stdin.readline

    sys.setrecursionlimit(10 ** 6)
    n, m = map(int, input().split())
    if n == m:
        print('Yes')
        exit(0)
    print('No')


if __name__ == '__main__':
    main()

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

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

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

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

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

main()

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

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

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

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("YNeos"[n!=m::2])

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

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

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

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):
import sys
import math
from collections import defaultdict

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def II(): return map(int, input().split())
def III(): return list(map(int, input().split()))
def Line(N,num):
    if N<=0:
        return [[] for _ in range(num)]
    elif num==1:
        return [I() for _ in range(N)]
    else:
        read_all = [tuple(II()) for _ in range(N)]
        return map(list, zip(*read_all))



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

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  

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

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

Solution (Python):
from sys import stdin

n,m = [int(x) for x in stdin.readline().rstrip().split()]

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

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

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

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

else:
    print("No")

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

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











import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,hypot,log 
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    N,M=MI()
    if N==M:
        print("Yes")
    else:
        print("No")
if __name__ == '__main__':
    main()

Solution (Python):
n,m = [int(i) for i in 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):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
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 [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

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


print(main())

Solution (Python):
import bisect
import cmath
import heapq
import itertools
import math
import operator
import os
import random
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7



N, M = list(map(int, sys.stdin.buffer.readline().split()))
ok = N == M
if ok:
    print('Yes')
else:
    print('No')

Solution (Python):

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

Solution (Python):

import sys
INF = float("inf")


def yes():
    print("Yes")  


def no():
    print("No")  


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

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
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)]

sys.setrecursionlimit(1000000)
mod = 1000000007

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


if __name__ == "__main__":
    solve()

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