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:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
arg=input().split()
N=int(arg[0])
M=int(arg[1])
if N==M:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
n,m=input().split();print('YNeos'[n!=m::2])

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,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(_) for _ in input().split()]

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

judge = 'Yes' if N==M else 'No'

print(judge)

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-


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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

YES = "Yes"  # type: str
NO = "No"  # type: str


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


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    M = int(next(tokens))  # type: int
    solve(N, M)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

if M == N:
    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:
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().rstrip().split(' ')]; 
print('Yes') if N==M else print('No')

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
I = input().strip().split()
if I[0] == I[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:
import  numpy as np
import math

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

Submission status: Accepted

Solution code:
A,B = (int(x) for x in input().split())
print("Yes" if A==B 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:
a = input().split()
N = int(a[0])
M = int(a[1])
if N == M :
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def read_ints(row):
    return list(map(int, row().split()))
  
import sys
 
row =sys.stdin.readline
N,M = read_ints(row)
print("Yes" if N == M else "No")

Submission status: Accepted

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

Submission status: Accepted

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

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

print('No')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

def sRaw():
    return input().rstrip("\r")


def iRaw():
    return int(input())


def ssRaw():
    return input().split()


def isRaw():
    return list(map(int, ssRaw()))

INF = 1 << 29

DIV = (10**9) + 7

def mod_inv_prime(a, mod=DIV):
    return pow(a, mod-2, mod)

def mod_inv(a, b):
    r = a
    w = b
    u = 1
    v = 0
    while w != 0:
        t = r//w
        r -= t*w
        r, w = w, r
        u -= t*v
        u, v = v, u
    return (u % b+b) % b


def CONV_TBL(max,mod=DIV):
    fac,finv,inv = [0]*max, [0]*max, [0]*max
    fac[0]=fac[1]=1
    finv[0]=finv[1]=1
    inv[1]=1
    for i in range(2,max):
        fac[i] = fac[i-1]*i % mod
        inv[i] = mod -inv[mod%i] * (mod//i)%mod
        finv[i] = finv[i-1]*inv[i]%mod
    class CONV:
        def __init__(self):
            pass
        def ncr(self,n,k):
            if(n<k):
                return 0
            if(n<0 or k<0 ):
                return 0
            return fac[n]*(finv[k]*finv[n-k]%mod)%mod
    return CONV()



def main():
    N,M =isRaw()
    return "Yes" if N==M else "No"


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

class Solution:
    def solve(self, n, m):
        return n == m


sol = Solution()

[n, m] = list(map(int, input().strip().split(" ")))

print("Yes" if sol.solve(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:
# -*- coding: utf-8 -*-

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

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

Submission status: Accepted

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

TestCaseNum, ACNum = map(lambda x: int(x), input().split())
if TestCaseNum==ACNum:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ABC152 A
N, M = tuple(input().split())

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

Submission status: Accepted

Solution code:
num = list(input().split())

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

Submission status: Accepted

Solution code:
from sys import stdin
def solve():
  n,m=map(int,stdin.readline().split())
  if n==m:
    print('Yes')
  else:
    print('No')
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())
if n==m:
  result = 'Yes'
else:
  result = 'No'
print(result)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

class Solution:
    def solve(self, N: int, M: int) -> str:
        if N == M:
            return 'Yes'
        else:
            return 'No'


if __name__ == '__main__':

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

    # solve
    solution = Solution()
    print(solution.solve(N, M))

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

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

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

Submission status: Accepted

Solution code:
a,b=input().strip().split(" ")
a,b=[int(a),int(b)]
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:
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())

ans = 'No'
if a == b:
    ans = 'Yes'

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
from sys import stdin
# import numpy as np
# import sys
# sys.setrecursionlimit(10**4)

def _li(): return list(map(int, stdin.readline().split()))
def _li_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def _lf(): return list(map(float, stdin.readline().split()))
def _ls(): return stdin.readline().split()
def _i(): return int(stdin.readline())
def _f(): return float(stdin.readline())
def _s(): return stdin.readline()[:-1]


N, M = _li()
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:
val = input().split()    
if val[0]==val[1]:    
    print("Yes")    
else:    
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

"""
name: 152A.py
プログラムの説明
"""

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def check_winner(N, M):
    if N == M:
        return "Yes"
    return "No"

if __name__ == "__main__":
    test1 = "3 3"
    test2 = "3 2"
    test3 = "5 0"
    test = test3
    test_input = map(int, input().split())
    print(check_winner(*test_input))

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = [int(e) for e in input().split(" ")]
print("Yes" if n[0] == n[1] 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 = input().split()
n = int(n)
m = int(m)

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

Submission status: Accepted

Solution code:
n, m = list(map(int, input().split()))
#s = len(n)
if n==m:
    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:
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:
n,m = input().split(' ')
n = int(n)
m = int(m)
if n == m:
  print('Yes')
else:
 print('No')

Submission status: Accepted

Solution code:
import sys
a, b = [int(x) for x in sys.stdin.readline().rstrip('\n').split()]
if a == b:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
n,m = input().split()
N = int(n)
M = int(m)
if N == M:
  print('Yes')
else:
  print('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:
import sys
import os

#fname = "..\problems\problem1.txt"
#f = open(fname, 'r')
#sys.stdin = f

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

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

Submission status: Accepted

Solution code:
import sys
from operator import itemgetter
import collections


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ls = [int(i) for i in input().split()]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#import sys
#input = sys.stdin.readline
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:
def main(n, m):
    if n == m:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    n, m = input().split()
    main(n, m)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():
    from sys import stdin, setrecursionlimit
    #setrecursionlimit(10**9)
    #n = int(stdin.readline()[:-1])   
    r = stdin.readline()[:-1]
    #r = [stdin.readline() for i in range(n)]
    #t = [int(stdin.readline()) for i in range(n)]
    #n = int(r)
    #a = r.split()
    #a,b,c = r.split()
    a = list(map(int, r.split()))
    #a,b,c,d = map(int, r.split())
    #a = [int(s[i]) for i in range(1, n+1)]
    #a = [list(map(int, r.split())) for i in range(1,n+1)]
    #res = 0

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a=input().rstrip().split(" ")
if a[0]==a[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:
input_line=list(map(int,input().split()))
if input_line[0]==input_line[1]:
    print ('Yes')
else:
    print ('No')

Submission status: Accepted

Solution code:
a, b = [int(x) for x in input().split()]
if a > b:
  print('No')
else:
  print('Yes')

Submission status: Accepted

Solution code:
In = input().split(" ")
N = int(In[0])
M = int(In[1])

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

Submission status: Accepted

Solution code:
S = input()
S = S.split(" ")
N = S[0]
M = S[1]

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

Submission status: Accepted

Solution code:
import sys
n, m = [int (e) for e in sys.stdin.readlines()[0].split(" ")]
print("Yes" if n == m else "No")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = input().split()
N, M = int(x[0]), int(x[1])
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 = input().split()

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

Submission status: Accepted

Solution code:
n = 0
m = 0
ac = input()
n = ac.split()[0]
m = ac.split()[1]

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
i = list(map(int, input().split()))
if i[0] == i[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 = input().split()
print('Yes' if n == m else '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:
Input = list(map(int, input().split()))
N = Input[0]
M = Input[1]

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

Submission status: Accepted

Solution code:
n, m = list(map(int, input().split()))
if m < n:
    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 = input().split()
if N == M:
  print('Yes')
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:
def test_cases(cases: list) -> str:
	if cases[0] == cases[1]:
		return "Yes"
	return "No"

case = input()
cases = case.split()
print(test_cases(cases))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b=input().split();print('YNeos'[a!=b::2])

Submission status: Accepted

Solution code:
q = list(map(int, input().split()))
if q[0] == q[1]:
    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:
i,j = map(int, input().split())

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

Submission status: Accepted

Solution code:
print(len(set(input().split()))==1 and "Yes" or "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, y = input().split(' ')
if x == y:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N_M = input().split() #s_1 s_2を分割して取得し、sに値を入れる
N = int(N_M[0])
M = int(N_M[1])

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

Submission status: Accepted

Solution code:
a=raw_input()
m=a.split()
N,M=map(int,m)
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:
list_num = list(map(int, input().split(' ')))

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

Submission status: Accepted

Solution code:
s = input()
ls = list(s.split(" "))
if(int(ls[0])==int(ls[1])):
  print("Yes")
else:
  print("No")