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

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

def main():
    n,m=MI()
    if n==m:print("Yes")
    else:print("No")
main()

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

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

Solution (Python):


import sys
import math
import time
import numpy as np
import collections
from collections import deque
import queue
import copy


def gcd(m,n):
  x = max(m,n)
  y = min(m,n)
  if x%y == 0:
    return y
  else:
    while x%y != 0:
      z = x%y
      x = y
      y = z
    else:
      return z


def bfs(SS, x, y, H, W):
  x_next = [0, 0, -1, 1]
  y_next = [1, -1, 0, 0]
  tempx = x
  tempy = y
  mlength = 0
  q = deque()
  xytuple = (x, y, 0)
  q.append(xytuple)


  while q:
    xytuple = q.popleft()
    SS[xytuple[0]][xytuple[1]] = "x" 
    for i in range(4): 
      tempx = xytuple[0] + x_next[i]
      tempy = xytuple[1] + y_next[i]
      
      
      if(0 <= tempx and tempx < H and 0 <= tempy and tempy < W and SS[tempx][tempy] == "."):
        temptuple = (tempx, tempy, xytuple[2]+1)
        SS[temptuple[0]][temptuple[1]] = "x" 
        mlength = max(mlength, xytuple[2] +1)
        q.append(temptuple)
      
  return mlength



NM = str(input()).split()
N = int(NM[0])
M = int(NM[1])



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

Solution (Python):
def main():
    if eval(input().replace(" ","==")):
        print("Yes")
    else:
        print("No")
    
if __name__ == '__main__':
    main()

Solution (Python):
import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)

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

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

N = int(x[0])
M = int(x[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 = 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 = 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):
x = input().strip().split(' ')
if(x[0]==x[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())
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):
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):
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())
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())
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
import math
import collections



tmp = input().split()
a,b = list(map(lambda a: int(a), tmp))

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

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

Solution (Python):


import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
read = sys.stdin.read





n,m = [int(i) for i in readline().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):
a, b = map(int,input().split())

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

Solution (Python):
import sys
input = sys.stdin.readline
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 = 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):

import sys

YES = "Yes"  
NO = "No"  


def solve(N: int, M: int):
    if N == M:
        print(YES)
    else:
        print(NO)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    M = int(next(tokens))  
    solve(N, M)

if __name__ == '__main__':
    main()

Solution (Python):



test = ""

"""
1 1
"""

test = list(reversed(test.strip().splitlines()))
if test:
    def input2():
        return test.pop()
else:
    def input2():
        return input()


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

Solution (Python):


import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

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

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())
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 = [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):
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
 
stdin = sys.stdin
 
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()
nas = lambda: stdin.readline().split()

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

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

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

ABC152A()

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

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

Solution (Python):

import sys

YES = "Yes"  
NO = "No"  


def solve(N: int, M: int):
    if N==M:
        print(YES)
    else:
        print(NO)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    M = int(next(tokens))  
    solve(N, M)

if __name__ == '__main__':
    main()

Solution (Python):
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
from collections import defaultdict
from collections import deque
import numpy as np
import heapq
from heapq import heappush, heappop



readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)

N, M = map(int, input().split())
a = N - M
if N - M > 0:
    ans = 'No'
else:
    ans = 'Yes'

print(ans)

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 = [int(i) for i in input().split()]

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

cond()

Solution (Python):
def solve(n, m):
    if n == m:
        return "Yes"
    else:
        return "No"


def main():
    n, m = map(int, input().split())
    res = solve(n, m)
    print(res)


def test():
    assert solve(3, 3) == "Yes"
    assert solve(3, 2) == "No"
    assert solve(1, 1) == "Yes"


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

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

Solution (Python):
import sys
import math

N, M = map(int, sys.stdin.readline().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())
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:
    ans = 'Yes'
else:
    ans = 'No'

print(ans)

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

Solution (Python):
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input(): return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

Solution (Python):
from sys import stdin
N, M = [int(i) for i 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 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):
n, m = map(int, input().split())
print("Yes" if n == m else "No")

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

print(['No', 'Yes'][n == m])

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

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 N == M else NO)


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

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

resolve()

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

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

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

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

Solution (Python):
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
input = sys.stdin.readline

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




import sys
input = sys.stdin.readline



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



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

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

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

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

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

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

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

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

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

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

Solution (Python):
if __name__ == '__main__':
    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=list(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):
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):


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

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



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, s.split())) for s in open(0)]
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())

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

sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return list(map(int, sys.stdin.readline().split()))
def II(): return int(sys.stdin.readline())
def LS(): return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]

def main():
    n, m = LI()
    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 = 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 = [int(el) for el in 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):
nm=input().split(" ")
N=int(nm[0])
M=int(nm[1])
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
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input(): return sys.stdin.readline().rstrip()

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):
import numpy as np

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



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

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

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

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

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


if __name__ == '__main__':
    main()

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

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

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

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

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

Solution (Python):


from queue import Queue
from queue import LifoQueue as Stack
from math import sqrt
from fractions import gcd

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

def intinput():
    return int(input())

def mulinputs():
    return map(int,input().split())

def lineinputs(func=intinput):
    datas = []
    while True:
        try:
            datas.append(func())
        except EOFError:
            break
    return datas



N, M = mulinputs()


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.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

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

Solution (Python):




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


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

Solution (Python):
import math
import calendar
import fractions
import itertools

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

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