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



Sample input:
3 3


Sample output:
Yes

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
print(['No', 'Yes'][a == b])

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n1, n2 = [int(i) for i in input().split()]

if n1 == n2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
  N, M = map(int, input().split())
  if N == M:
    print("Yes")
  else:
    print("No")
if __name__ == "__main__":
  main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
print("Yes" if len(set(map(int,input().split())))==1 else "No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print("Yes" if len(set(map(int, input().split()))) == 1 else "No")

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)

def LI(): return list(map(int, stdin.readline().split()))
def LS(): return list(stdin.readline())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def ISI(): return map(int, sys.stdin.readline().rstrip().split())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N, M = map(int, input().split())
print('YNeos'[N!=M::2])

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-


# 入力を整数に変換して受け取る
def input_int():
    return int(input())


# マイナス1した値を返却
def int1(x):
    return int(x) - 1


# 半角スペース区切り入力をIntに変換してMapで受け取る
def input_to_int_map():
    return map(int, input().split())


# 半角スペース区切り入力をIntに変換して受け取る
def input_to_int_tuple():
    return tuple(map(int, input().split()))


# 半角スペース区切り入力をIntに変換してマイナス1した値を受け取る
def input_to_int_tuple_minus1():
    return tuple(map(int1, input().split()))


def main():
    n, m = input_to_int_map()

    ret = "No"
    if n == m:
        ret = "Yes"

    return ret


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a= list(map(int,input().split()))
n=a[0]
m=a[1]
if n==m:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,m = (int(x) for x in input().split())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,m=map(int,input().split())
print("YNeos"[n!=m::2])

Submission status: Accepted

Solution code:
s,j= input().split()
if s==j:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin, setrecursionlimit


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


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
# ABC152A

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# from math import ceil,sqrt,log,gcd
# def ii():return int(input())
# def si():return input()
# def mi():return map(int,input().split())
# def li():return list(mi())




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

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:
import sys
import math
import bisect

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N,M = map(int, input().split())
# N = int(input())
# s = int(input())
# C = int(input())
# s= input()
print("Yes" if M == N else "No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import fileinput

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':

    ABC_152_A()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat May  9 01:29:25 2020

@author: shinba
"""

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

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

Submission status: Accepted

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


if __name__ == '__main__':
    solve()

Submission status: Accepted

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


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
#from collections import defaultdict, deque, Counter
#from bisect import bisect_left
#import heapq
#import math
#from itertools import groupby as gb
#from itertools import permutations as perm
#from itertools import combinations as comb
#from fractions import gcd
#import numpy as np

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

#n = int(stdin.readline().rstrip())
#l = list(map(int, stdin.readline().rstrip().split()))
n,m = map(int, stdin.readline().rstrip().split())
#AB = [list(map(int, stdin.readline().rstrip().split())) for _ in range(n)]

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
il = [int(k) for k in input().split()]
if il[0] == il[1] :
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
val = input().split()

N = int(val[0])
M = int(val[1])

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations, accumulate
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
import sys
def I(): return int(input())  # '123' -> 123
def Is(): return map(int, input().split())  # '123 456' -> 123, 456
def LI(): return list(map(int, input().split()))  # '123 456' -> [123, 456]
def TI(): return tuple(map(int, input().split()))  # '123 456' -> (123, 456)
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()  # 'aa bb' -> 'aa','bb' or ['aa','bb']
def LS(): return list(input())  # 'abc123' -> ['a','b','c','1','2','3']
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(1000000)
MOD = 1000000007
INF = float('inf')

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A - AC or WA

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

Solution code:
from sys import stdin


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

else :
    print('No')

Submission status: Accepted

Solution code:

A, B = map(int, input().split())

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

Submission status: Accepted

Solution code:
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)]
#import bisect #bisect.bisect_left(B, a)
#from collections import defaultdict #d = defaultdict(int) d[key] += value
#from collections import Counter # a = Counter(A).most_common()
#from itertools import accumulate #list(accumulate(A))

N, M = mi()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input().split();print("YNeos"[s[0]!=s[1]::2])

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(solve())

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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)]
#import bisect #bisect.bisect_left(B, a)
#from collections import defaultdict #d = defaultdict(int) d[key] += value
#from collections import Counter # a = Counter(A).most_common()
#from itertools import accumulate #list(accumulate(A))

N, M = mi()

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

Submission status: Accepted

Solution code:
n=[int(i) for i in input().split()]
if n[0]==n[1]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
l  = [int(x) for x in input().split()]
if l[0]==l[1]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

import sys
# import math
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product                # product(iter, repeat=n)
# from itertools import accumulate             # accumulate(iter[, f])
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from copy import deepcopy                    # to copy multi-dimentional matrix without reference
# from fractions import gcd                    # for Python 3.4


def main():
    mod = 1000000007                  # 10^9+7
    inf = float('inf')
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    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()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

if n > m:
  print("No")

else:
  print("Yes")

Submission status: Accepted

Solution code:
n,m = (int(x) for x in input().split())

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():
    N, M = map(int, input().split())
    if N == M:
        print("Yes")
    else:
        print("No")
if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#N = int(input())
l = [int(x) for x in input().split()]
if l[0] == l[1]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
n, m = map(int, sys.stdin.readline().split())
if n == m:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if n ==m:

    print("Yes")
else:print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#スペース区切りの整数入力
N, M = map(int, input().split()) 
#N,Mの比較
if N==M:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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