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

Submission status: Accepted

Solution code:
a=set(input().split());print("YNeos"[len(a)-1::2])

Submission status: Accepted

Solution code:
m,n=map(int,input().split())
print('Yes') if m==n 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:
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:
a, b = input().split()
print(['Yes', 'No'][a!=b])

Submission status: Accepted

Solution code:
input_line = input()

qwestion,answer = input_line.split()

judge = 'Yes'

if qwestion != answer:
    judge = 'No'
    
print(judge)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print("Yes") if a == b 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:
#!/usr/bin/env python3

import sys
sys.setrecursionlimit(300000)

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

def solve(N: int, M: int):
    if N == M:
        ret = YES
    else:
        ret = NO
    print(ret)
    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))  # type: int
    M = int(next(tokens))  # type: int
    solve(N, M)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
mod2 = 998244353
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
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 pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)


def main():
    n,m = LI()
    if n == m:
        return 'Yes'

    return 'No'


print(main())

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
print('Yes' if a is 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=input().split();print("YNeos"[a!=b::2])

Submission status: Accepted

Solution code:
M, N = map(int, input().split())
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 sys
input = sys.stdin.readline

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

Submission status: Accepted

Solution code:
#A - AC or WA
n, m = list(map(int,input().split()))
if n == m:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
N, M = [int(_) for _ in stdin.readline().rstrip().split()]
print('Yes' if N == M else '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 = 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:
  ans="Yes"
else:
  ans="No"
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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 = input().split(" ")
N = int(N)
M = int(M)
if (M == N):
  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:
import sys
input = sys.stdin.readline

def main():
    n = list(map(int, input().split()))
    ans = "Yes" if n[0] == n[1] else "No"
    print(ans)
main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(map(int,input().split()))
if s[0] == s[1]:
    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:
input = input().rstrip().split()
print("Yes" if input[0] == input[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:
def main():
  a,b = map(int,input().split())
  ans = check(a,b)
  print(ans)
  
def check(n,m):
  if n == m:
    return "Yes"
  else:
    return "No"
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("No" if N!=M else "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:
a,b = map(int,input().split())
if a == b:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
import sys
import socket

hostname = socket.gethostname()

if hostname == 'F451C':
    sys.stdin = open('a1.in')


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


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


def read_int():
    return int(input())


def read_str():
    return input()


def main():
    n, m = read_int_list()
    if n > m:
      res = 'No'
    else:
      res = 'Yes'
    print(res)


main()

Submission status: Accepted

Solution code:
#coding: utf-8
 
s = input().split()
if s[0]==s[1]:
  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:
#!/usr/bin/python3
# -*- coding:utf-8 -*-

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

if __name__=='__main__':
  main()

Submission status: Accepted

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

Submission status: Accepted

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

n,m = map(int,input().split())
if m == n : 
    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:
#!/usr/bin/env python3
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n,m = map(int,read().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:
s,t=map(int,input().split())
if s==t:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations,groupby
import sys
import bisect
import string
import math
import time
import random
def S_():
    return input()
def LS():
    return [i for i in input().split()]
def I():
    return int(input())
def MI():
    return map(int,input().split())
def LI():
    return [int(i) for i in input().split()]
def LI_():
    return [int(i)-1 for i in input().split()]
def NI(n):
    return [int(input()) for i in range(n)]
def NI_(n):
    return [int(input())-1 for i in range(n)]
def StoI():
    return [ord(i)-97 for i in input()]
def ItoS(nn):
    return chr(nn+97)
def LtoS(ls):
    return ''.join([chr(i+97) for i in ls])
def GI(V,E,Directed=False,index=0):
    org_inp=[]
    g=[[] for i in range(n)]
    for i in range(E):
        inp=LI()
        org_inp.append(inp)
        if index==0:
            inp[0]-=1
            inp[1]-=1
        if len(inp)==2:
            a,b=inp
            g[a].append(b)
            if not Directed:
                g[b].append(a)
        elif len(inp)==3:
            a,b,c=inp
            aa=(inp[0],inp[2])
            bb=(inp[1],inp[2])
            g[a].append(bb)
            if not Directed:
                g[b].append(aa)
    return g,org_inp
def bit_combination(k,n=2):
    rt=[]
    for tb in range(n**k):
        s=[tb//(n**bt)%n for bt in range(k)]
        rt+=[s]
    return rt
def show(*inp,end='\n'):
    if show_flg:
        print(*inp,end=end)
YN=['Yes','No']
mo=10**9+7
inf=float('inf')
l_alp=string.ascii_lowercase
u_alp=string.ascii_uppercase
ts=time.time()
sys.setrecursionlimit(10**5)
input=lambda: sys.stdin.readline().rstrip()

def ran_input():
    import random
    n=random.randint(4,16)
    rmin,rmax=1,10
    a=[random.randint(rmin,rmax) for _ in range(n)]
    return n,a

show_flg=False
show_flg=True

ans=0


ans=0

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

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

Submission status: Accepted

Solution code:
#a ac or wa
n,m=input().split()
ans="No"
if n==m:
    ans="Yes"
print(ans)

Submission status: Accepted

Solution code:
nm=input().split()
n=nm[0]
m=nm[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")
	exit()
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:
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 n == m :
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(" YNeos"[len(set(input().split()))::2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print("No"if len(set(input().split()))>1else"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 = list(map(int,input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input()
b=a.split()
if int(b[0])==int(b[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:
# A - AC or WA
def main():
    N, M = map(int, input().split())
    is_correct = N == M
    print("Yes" if is_correct else "No")


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
N,M= [i for i in 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())
print("Yes" if(n==m) 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:
M, N = input().split()
M = int(M)
N = int(N)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,m=[i for i in input().split()]
print('Yes' if n==m 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:
#input
N, M = map(int, input().split())

#output
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:
a,c = map(int,input().split())

print("Yes") if a==c else print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
    return list(map(int,input().split()))
def m(): #複数文字
    return map(int,input().split())
def onem(): #Nとかの取得
    return int(input())
def s(x): #圧縮
    a = []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): #listをスペースごとに分ける
    return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
    return max(map(max,x))
def In(x,a): #aがリスト(sorted)
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False
"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""

n,m = m()

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

Submission status: Accepted

Solution code:
import sys


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


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    import sys
    print(solve(sys.stdin.read().strip()))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,m=input().split()
n,m=int(n),int(m)
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
a, b = stdin.readline().rstrip().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:
m,n = map(int,input().split())

if m == n: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:
#abc152a

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

Submission status: Accepted

Solution code:
def main(n, m):
    if n == m:
        print('Yes')
    else:
        print('No')


if __name__ == "__main__":
    n, m = map(int, input().split())

    main(n, m)

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 queue as Q

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

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

Submission status: Accepted

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

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

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

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=input().split()
print("Yes" if N[0]==N[1] 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:
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());print("Yes" if a==b else "No")

Submission status: Accepted

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


if b==c:
    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:
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 wczytaj_liste(): 
    wczytana_lista = input()
    lista_znakow = wczytana_lista.split()
    ostateczna_lista = []
    for element in lista_znakow:
        ostateczna_lista.append(int(element))
    return ostateczna_lista 

def AC_WC():
    N, M = wczytaj_liste()
    if N == M: 
        print('Yes')
    else: 
        print('No')
        
AC_WC()

Submission status: Accepted

Solution code:
a, b = [int(x) for x in 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:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10000000)
INF = 1<<32

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

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))  # type: int
    M = int(next(tokens))  # type: int
    solve(N, M)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math as mt
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 = 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())

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

Submission status: Accepted

Solution code:
def acinput():
    return list(map(int, input().split(" ")))



import numpy as np
#from functools import reduce
import math
import string
import itertools
import fractions
import heapq
import collections
import re
import array
import bisect
import sys
import random
import time
import copy
import functools

N,M=acinput()

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
L, R = input().split()

if L == R:
  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 = input().split()
a = int(a)
b = int(b)
if a == b:
    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:
# -*- coding: utf-8 -*-
n,m = map(int, input().split())
if n==m:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
def acinput():
    return list(map(int, input().split(" ")))


N,M=acinput()

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:
r = input()
k=r.split()
if k[0] == k[1]:
    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:
input = input().split(" ")
if input[0] == input[1]:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    x, y = map(int, input().split(' '))
    if y >= x:
        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:
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, A = input().split() 
Num = int(N)
Num1 = int(A)
if (N == A):
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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