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

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

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

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

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())
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):
input_line = input().rstrip().split()
if (input_line[0]==input_line[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):
from sys import setrecursionlimit, exit
setrecursionlimit(1000000000)

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

main()

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

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

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

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

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

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

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

print(main())

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

Solution (Python):
from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
from collections import deque,Counter,defaultdict
from operator import mul
import copy


import heapq
sys.setrecursionlimit(10**6)

INF = 10**18
import bisect
import statistics
mod = 10**9+7


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("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(['No', 'Yes'][n == m])

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

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

Solution (Python):
from sys import stdin
nii=lambda:map(int,stdin.readline().split())
lnii=lambda:list(map(int,stdin.readline().split()))

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

rStr = input()

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

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

Solution (Python):

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

if __name__ == "__main__":
    resolve()

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):
getS = lambda: input().strip()
getN = lambda: int(input())
getList = lambda: list(map(int, input().split()))
getZList = lambda: [int(x) - 1 for x in input().split()]
n, m = getList()
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())
print("Yes" if N == M else "No")

Solution (Python):
ri = lambda S: [int(v) for v in S.split()]
def rii(): return ri(input())
 
N, M = rii()

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 exit
import math
import collections
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

n,m = mi()
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):
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 = 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

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


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

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

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

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

    print(ans)


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())
ans = "No"
if a == b:
  ans = "Yes"
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())
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, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


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


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


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


def main():
    solve()


if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
N, M = [int(v) for v in input().rstrip().split()]
r = 'Yes' if N == M else 'No'
print(r)

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

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

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

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

Solution (Python):
import sys, bisect, math, itertools, string, queue, copy








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(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

n, m = inpm()
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):
import sys

H, M = map(int, next(sys.stdin.buffer).split())
print('Yes' if H == M else 'No')

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

Solution (Python):

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

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

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

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

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

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

Solution (Python):

def inputlist(): return [int(j) for j in input().split()]

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

Solution (Python):
def main():

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


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

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

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

Solution (Python):
score = list(map(int,input().split()))
if score[0] == score[1]:
    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, bisect, math, itertools, string, queue, copy
import numpy as np
import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
from fractions import gcd
input = sys.stdin.readline
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(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

n,m = inpm()

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

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,numpy,string
import sys
sys.setrecursionlimit(10**7)

def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())

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

main()

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

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

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

Solution (Python):
import os, sys, re, math

(N, M) = [int(n) for n in input().split()]

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

Solution (Python):
N, M = [int(s) for s in input().split()]
print('Yes' if N==M else 'No')

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

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


from typing import *
import collections
import functools
import itertools
import math
import sys

INF = float('inf')
YES = "Yes"  
NO = "No"  


def solve(N: int, M: int):
    return [NO, YES][N == M]


def main():

    sys.setrecursionlimit(10 ** 6)

    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))  
    print(f'{solve(N, M)}')


if __name__ == '__main__':
    main()

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

Solution (Python):

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

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):
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(): 入力を文字列として1行取ってくる
"文字列".split(): 文字列をパースする（空白などで分割する）
    例："2 3 4 5"　をsplitしたら、[2, 3, 4, 5] に分割する
map(型, list): list の中身をそれぞれ指定した型で変数に入れる
"""
N, M = map(int, input().split())

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

Solution (Python):
"""
input(): 入力を文字列として1行取ってくる
"文字列".split(): 文字列をパースする（空白などで分割する）
    例："2 3 4 5"　をsplitしたら、[2, 3, 4, 5] に分割する
map(型, list): list の中身をそれぞれ指定した型で変数に入れる
"""
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 = 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():
    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())

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):
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(['No', 'Yes'][N == M])

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

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

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

if '__main__' == __name__:
    resolve()

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):
A,B=map(int, input().split())
print("Yes") if A==B 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=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 solve():
    N,M = [int(i) for i in input().split()]
    if N == M:
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    solve()

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):
def main():

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

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

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

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


if __name__ == '__main__':
    main()

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

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

    if N == M:
        ans = 'Yes'

    else:
        ans = 'No'

    print(ans)


if __name__ == "__main__":
    main()

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

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

result = ac_or_wa()
print(result)

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

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

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

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

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

Solution (Python):
tmp = input().split(" ")

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

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