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

Solution (Python):
N, M = [int(_) for _ in 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):
s=input().split();print("YNeos"[s[0]!=s[1]::2])

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

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

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

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

print(solve())

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10**8)
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 li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i for i2 in range(j)]
def dp3(ini, i, j, k): return [[[ini]*i for i2 in range(j)] for i3 in range(k)]





N, M = mi()

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

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

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

Solution (Python):
N,M=[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):
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**6)
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

n,m = na()

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):
l  = [int(x) for x in input().split()]
if l[0]==l[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 M == N:
    print("Yes")
else:
    print("No")

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

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

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

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

Solution (Python):
N,M = map(int, input().split())
if N== 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().rstrip().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())
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 main():
    mod = 1000000007                  
    inf = float('inf')
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():  return int(input())
    def mi():  return map(int, input().split())
    def mi_0(): return map(lambda x: int(x)-1, input().split())
    def lmi(): return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():  return list(input())
    
    
    n, m = mi()
    print('Yes') if m == n 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):
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 print('No')

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

if n > m:
  print("No")

else:
  print("Yes")

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

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

l = [int(x) for x in input().split()]
if l[0] == l[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):
import sys
n, m = map(int, sys.stdin.readline().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, k = map(int, input().split())
if(n == k):
  print('Yes')
else:
  print('No')

Solution (Python):
print('YNeos'[eval(input().replace(' ','!='))::2])

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

Solution (Python):
print('YNeos'[len(set(input().split()))-1::2])

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

if x[0] == x[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):
a,b=(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 m == n else print('No')

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

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

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

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

if num[1] < num[0]:
  print("No")
else:
  print("Yes")

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

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

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

Solution (Python):

import math


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


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


print(text)

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

Solution (Python):
import sys
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7

N, M = rl()

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):
from collections import deque, Counter as cnt
from collections import defaultdict as dd
from operator import itemgetter as ig
from bisect import bisect_right as bsr
from math import factorial, ceil, floor
import sys
sys.setrecursionlimit(1000000)


args = None
INF = float("inf")
MOD = int(1e9 + 7)


def input(*ps):
    if type(ps[0]) is list:
        return [input(*ps[0][:-1]) for _ in range(ps[0][-1])]
    elif len(ps) == 1:
        return ps[0](next(args))
    else:
        return [p(next(args)) for p in ps]


def nlist(n, v):
    if not n:
        return [] if type(v) is list else v
    return [nlist(n[1:], v) for _ in range(n[0])]


def yesno(v, yes="Yes", no="No", upper=False):
    if upper:
        print([yes.upper(), no.upper()][not v])
    else:
        print([yes, no][not v])


def main():
    """エントリーポイント"""
    N, M = input(int, int)
    yesno(N == M)


if __name__ == '__main__':
    args = iter(sys.stdin.read().split())
    main()

Solution (Python):
str = input().split()
n = int(str[0])
m = int(str[1])
if n == m:
  print("Yes")
else:
  print("No")

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

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

Solution (Python):
H,A=input().split()
print('Yes' if H==A 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 main():
    N, M = map(int, open(0).read().split())

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


main()

Solution (Python):
n,m = list(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 = (int(x) for x in 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):
M,N=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())
print("Yes" if n == m else "No")

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

DR = [1, -1, 0, 0]
DC = [0, 0, 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 LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
     
def main():
    n, m = LI()
    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 = 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):
n, m = list(map(int, input().split()))
print('Yes') if n == m else print('No')

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

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

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

Solution (Python):

def q1():
    N, M = (int(i) for i in input().split())
    if N == M:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    q1()

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

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):
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
from functools import reduce
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):
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):
x = input()
n = int(x.split()[0])
m = int(x.split()[1])

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

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

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

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

Solution (Python):
print('Yes') if len(set(input().split()))==1 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):
import math

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

Solution (Python):
n, m = map(int,input().strip().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):
import sys
import os
import math

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

MOD = 10 ** 9 + 7


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

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

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

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

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

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

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

Solution (Python):

def input1():
	return int(input())


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


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


N,M=input2()

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

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 os

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 = 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):
print("Yes" if eval(input().replace(" ","-"))==0 else "No")

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

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

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

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

Solution (Python):
n, m = map(int, 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):
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    n, m = list(map(int, readline().split()))
    print("Yes" if n == m else "No")


if __name__ == '__main__':
    solve()

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

if n==m:
    print('Yes')
elif n!=m:
    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):
if len(set(input().split())) == 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')
if N>M:
    print('No')

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

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

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

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

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

if k!=x:
    print("No")
else:
    print("Yes")

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