qyliang/CodeNanoFix huggingface dataset:
Buggy code:
from sys import stdin
import math

n, m = [int(x) for x in stdin.readline().rstrip().split()]

if n * 500 > m:
    print('Yes')
else:
    print('No')

Fixed code:
from sys import stdin
import math

n, m = [int(x) for x in stdin.readline().rstrip().split()]

if n * 500 >= m:
    print('Yes')
else:
    print('No')
Buggy code:
b,c = map(int, input().split())
if 500 * b > c:
  print('Yes')
else:
  print('No')

Fixed code:
b,c = map(int, input().split())
if 500 * b >= c:
  print('Yes')
else:
  print('No')
Buggy code:
x,k=map(int,input().split())
if x*500>=k:
  print(Yes)
else:
  print(No)

Fixed code:
k,x = map(int,input().split())

if k*500>=x:
    print("Yes")
else:
    print("No")
Buggy code:
Ken, New = map(int, input().split())
if (Ken * 500) - New >= 0:
    print("Yes")
elif (Ken * 500) - New < 0:
    print("No")
else:
    

Fixed code:
Ken, New = map(int, input().split())
if (Ken * 500) - New >= 0:
    print("Yes")
elif (Ken * 500) - New < 0:
    print("No")
else:
    print("")
Buggy code:
x,y = map(int,input().split())
if x *500 >= y :
    print("Yes")
else: print("NO") 

Fixed code:
x,y = map(int,input().split())
if x *500 >= y :
    print("Yes")
else: print("No")
Buggy code:
k, x = map(int, input().split())
print('Yes' if 500*k>=x else'No)

Fixed code:
k, x = map(int, input().split())

if 500 * k >= x:
    print("Yes")
else:
    print("No")
Buggy code:
K,X = [int(x) for x in input().split()]

if X < K*500:
    print('Yes')
else :
    print('No')

Fixed code:
K,X = [int(x) for x in input().split()]

if X <= K*500:
    print('Yes')
else :
    print('No')
Buggy code:
k,x=map(int.input(),split())
if x <= k :
  print('Yes')
else :
  print('No')

Fixed code:
k, x = map(int, input().split())
if x <= k * 500:
    print("Yes")
else:
    print("No")
Buggy code:
K,X=map(int,input().split())
if 500*K>=500:
  print("Yes")
else:
  print("No")

Fixed code:
K, X = map(int, input().split())

if(K * 500 >= X):
    print("Yes")
else:
    print("No")
Buggy code:
k,x=map(int, input().split())
print('Yes' if k*500 > x else 'No')

Fixed code:
k,x = map(int,input().split())
if 500*k>=x:
  print("Yes")
else:
  print("No")
Buggy code:
tar, max = map(int, input().sprit())
if max <= tar * 500:
  print('Yes')
else:
  print('No')


Fixed code:
tar, max = map(int, input().split())
if max <= tar*500:
  print('Yes')
else:
  print('No')
Buggy code:
K, X = input().split()
K, X = int(K), int(X)

if K*500 > X:
    print("Yes")
else:
    print("No")

Fixed code:
K,X = map(int,input().split())
if 500*K >= X:
    print('Yes')
else:
    print('No')
Buggy code:
k,x=map(int,input().split())
if 500*k=>x:
  print("Yes")
else:
  print("No")

Fixed code:
k,x=map(int,input().split())
if 500*k>=x:
  print("Yes")
else:
  print("No")
Buggy code:
K,X = map(int,input().split)())
if K*500>=X:
    print('Yes')
else:
    print('No')


Fixed code:
K, X=map(int, input().split())

if 500*K >= X:
    print("Yes")
else:
    print("No")
Buggy code:
def resolve():
    K, X = map(int, input().split())
    if 500 * K >= X:
        print('Yes')
    else:
        print('No')


Fixed code:
K,X=map(int,input().split())
if(K*500>=X):
    print("Yes")
else:
    print("No")
Buggy code:
    K, X = map(int, input().split())
    if 500 * K >= X:
        print('Yes')
    else:
        print('No')

Fixed code:
K,X =map(int,input().split())
ans = "Yes" if 500*K >= X else "No"
print(ans)
Buggy code:
k, x = list(map(int, input().split()))
if k*500 > x:
  print('Yes')
else:
  print('No')

Fixed code:
k, x = list(map(int, input().split()))
if k*500 >= x:
  print('Yes')
else:
  print('No')
Buggy code:
import sys
input = sys.stdin.readline


class AtCoder:
    def main(self):
        X, K = map(int, input().split())

        if 500 * K >= 1000:
            print("Yes")
        else:
            print("No")

# Run main
if __name__ == '__main__':
    AtCoder().main()

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


class AtCoder:
    def main(self):
        K, X = map(int, input().split())

        if 500 * K >= X:
            print("Yes")
        else:
            print("No")

# Run main
if __name__ == '__main__':
    AtCoder().main()
Buggy code:
K,X=map(int,input(),split())
if 500*K>X:
    print('Yes')
else:
    print('No')

Fixed code:
K,X=map(int,input().split())
if 500*K>=X:
    print('Yes')
else:
    print('No')
Buggy code:
a,b = map(int, input().split())

if 500*a > b:
    print("Yes")
else:
    print("No")

Fixed code:
k, a = map(int, input().split())
 
if k * 500 >= a:
  print('Yes')
else:
  print('No')
Buggy code:
k, a = map(int(), input().split())
 
if k * 500 >= a:
  print('Yes')
else:
  print('No')

Fixed code:
k,n=map(int,input().split())
if k*500>=n:
    print("Yes")
else:
    print("No")
Buggy code:
k, x = map(int, input().split())
print('Yes') if 500 * k > x else print('No')

Fixed code:
k, x = map(int,input().split())

if 500*k >= x:
  print("Yes")
else:
  print("No")
Buggy code:
def two_int():
    N, K = map(int, input().split())
    return N,K

def one_int():
    return int(input())

def one_str():
    return input()

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

K, X = input().split()

if K*500 >= X:
    print("Yes")
else:
    print("No")

Fixed code:
def two_int():
    N, K = map(int, input().split())
    return N,K

def one_int():
    return int(input())

def one_str():
    return input()

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

K, X = two_int()

print()
if K*500 >= X:
    print("Yes")
else:
    print("No")
Buggy code:
K, X = [int(x) for x in input().split()]
print('Yes' if K*500 >X else 'No')

Fixed code:
K, X = [int(x) for x in input().split()]
print('Yes' if K*500 >= X else 'No')
Buggy code:
K,X=input().split()
k=int(K)
x=int(X)
if 500*k>==x:
  print('Yes')
else:
  print('No')

Fixed code:
K,X=input().split()
k=int(K)
x=int(X)
if 500*k>=x:
  print('Yes')
else:
  print('No')
Buggy code:
K,X=map(int,input().split())
if 500*K>=K:
    print('Yes')
else:
    print('No')

Fixed code:
N,K = map(int, input().split())
if N*500 >=K:
    print("Yes")
else:
    print("No")
Buggy code:
k, x = map(int input().split()) 
if 500*k >= x:
  print("Yes")
else:
  print("No")

Fixed code:
k, x = list(map(int, input().split()))
if k * 500 >= x:
  print('Yes')
else:
  print('No')
Buggy code:
K, X = map(int, input().split)
a = 500*K

if a >= X:
  print("Yes")
else:
  print("No")

Fixed code:
K, X = map(int, input().split())
a = 500*K

if a >= X:
  print("Yes")
else:
  print("No")
Buggy code:
K, X = map(int, input())

if 500 * X >= X:
    print('Yes')
else:
    print('No')


Fixed code:
K, X = map(int,input().split())
if (500*K) >= X:
  print('Yes')
else:
  print('No')
Buggy code:
a,b=map(int,input().split( ))
sum=a*500
if sum>=b:
  print("Yes")
else:
  print("NO")
exit()

Fixed code:
a,b=map(int,input().split( ))
sum=a*500
if sum>=b:
  print("Yes")
else:
  print("No")
exit()
Buggy code:
# -*- coding: utf-8 -*-

############### TESTCASE ###############
test = ""
test = \
"""
4 2001
"""
########################################
test = list(reversed(test.strip().splitlines()))
if test:
    def input2():
        return test.pop()
else:
    def input2():
        return input()
################# MAIN ################# 

k, x = map(int, input2().split())
if k * 500 - x >= 0:
    print("Yes")
else:
    print("No")



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

############### TESTCASE ###############
test = ""
#test = \
"""
4 2001
"""
########################################
test = list(reversed(test.strip().splitlines()))
if test:
    def input2():
        return test.pop()
else:
    def input2():
        return input()
################# MAIN ################# 

k, x = map(int, input2().split())
if k * 500 - x >= 0:
    print("Yes")
else:
    print("No")
Buggy code:
k,x =map(int,input().split()))
if k*500 >= x:
    print("Yes")
else:
    print("No")


Fixed code:
k,x=map(int,input().split())

if 500*k >= x:
    print('Yes')
else:
    print('No')
Buggy code:
N = list(map(int,input().split(" ")))

if N[0]*500 >= N[1]:
  print("Yes")
elif:
  print("No")

Fixed code:
N = list(map(int,input().split(" ")))
 
if N[0]*500 >= N[1]:
  print("Yes")
else:
  print("No")
Buggy code:
k,x = map(int,input().split())
ks = k * 500
if ks < k:
  print('No')
else:
  print('Yes')

Fixed code:
k,x = map(int,input().split())
ks = k * 500
if ks < x:
  print('No')
else:
  print('Yes')
Buggy code:
K,X=(int,input().split()))
if 500*K>=X:
    print("Yes")
else:
    print("No")

Fixed code:
K,X = map(int,input().split())


if 500*K>=X:
    print("Yes")
else:
    print("No")
Buggy code:
sp_list = list(map(int, input.split()))

if 500 * sp_list[0] >= sp_list[1]:
  print("Yes")
else:
  print("No")

Fixed code:
sp_list = list(map(int, input().split()))

if 500 * sp_list[0] >= sp_list[1]:
  print("Yes")
else:
  print("No")
Buggy code:
K,X = map(int,input().split())

ans = 'No'

y = 500 * K

if y > X:
  ans = 'Yes'

print(ans)

Fixed code:
K,X = map(int,input().split())

ans = 'No'

y = 500 * K

if y >= X:
  ans = 'Yes'

print(ans)
Buggy code:
l = [int(i) for i in input().split()]
K, X = l
if K * 500 > X:
    print('Yes')
else:
    print("no")

Fixed code:
l = [int(i) for i in input().split()]
K, X = l
if K * 500 >= X:
    print('Yes')
else:
    print("No")
Buggy code:
K, X = map(int, input().split())

if 500*K > X :
  print('Yes')
else :
  print('No')

Fixed code:
K, X = map(int, input().split())


if K * 500 >= X:
    print("Yes")
else:
    print("No")
Buggy code:
import sys
input = sys.stdin.readline

k, x = [int(x) for x in input().rstrip().split()]
print('Yes' if k * 2 >= x else 'No')


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

k, x = [int(x) for x in input().rstrip().split()]
print('Yes' if k * 500 >= x else 'No')
Buggy code:
K, X = map(int, input().split())

if K*500 > X:
  print('Yes')
else:
  print('No')

Fixed code:
K, X = map(int, input().split())
if K*500 >= X:
  print('Yes')
else:
  print('No')
Buggy code:
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,pprint,fractions
sys.setrecursionlimit(10**8)
mod = 10**9+7
mod2 = 998244353
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

k,x = inpl()
print('Yes' if x*500>=k else 'No')

Fixed code:
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,pprint,fractions
sys.setrecursionlimit(10**8)
mod = 10**9+7
mod2 = 998244353
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

x,k = inpl()
print('Yes' if x*500 >= k else 'No')
Buggy code:
k,x=map(int,input().split())
if 500*k>x:
  print("Yes")
if 500*x<x:
  print("No")

Fixed code:
k,x = map(int,input().split())
if k*500>=x:
  print("Yes")
else:
  print("No")
Buggy code:
x, k = map(int, input().split())
print("Yes") if 500 * k >= 500 else print("No")

Fixed code:
k,x= map(int, input().split())
a=500*k
if a>=x:
    print('Yes')
else:
    print('No')
Buggy code:
N, X = map(int, input().split())

if X >= N * 500:
    print("Yes")
else:
    print("No")


Fixed code:
N, X = map(int, input().split())

if X <= N * 500:
    print("Yes")
else:
    print("No")
Buggy code:
K, X = list(map(int, input().split()))
if(500 + K < X):
  print("No")
else:
  print("Yes")

Fixed code:
K, X = list(map(int, input().split()))
if(500 * K < X):
  print("No")
else:
  print("Yes")
Buggy code:
N,M= [int(i) for i in input().split()]
print("Yes" if N*500 > M else "No")

Fixed code:
N,M= [int(i) for i in input().split()]
print("Yes" if N*500 >= M else "No")
Buggy code:
A,B = map(int, input().split())

ans  = 500*A - B

if ans >0:
    print("Yes")
else:
    print("No")


Fixed code:
A,B = map(int, input().split())

ans  = 500*A - B

if ans >= 0:
    print("Yes")
else:
    print("No")
Buggy code:
K, X = map(int,input().split())

K = K*500
if(K >= X):
    print("yes")
else:
    print("No")

Fixed code:
K,X = map(int,input().split())
if(K*500 >= X): print('Yes')
else: print('No')
Buggy code:
k, x = map(int, input().split())
if max(500*k, x) == x:
  print("No")
else:
  print("Yes")

Fixed code:
k,x=map(int,input().split())
if 500*k<x:
    print("No")
else:
    print("Yes")
Buggy code:
K, X = input().split()

mon = 500*int(K)
if mon > int(X):
    print("Yes")
else:
    print("No")

Fixed code:
K, X = input().split()

mon = 500*int(K)
if mon >= int(X):
    print("Yes")
else:
    print("No")
Buggy code:
A = list(map(int, input().split()))

K = A[0]
X = A[1]

money = K*500

if X < 500:
	print ("No")
else:
	print("Yes")

Fixed code:
A = list(map(int, input().split()))
 
K = A[0]
X = A[1]
 
money = K*500
 
if X <= money:
	print ("Yes")
else:
	print("No")
Buggy code:
k,x=input().split()
if 500 * k >= x:
  print("Yes")
else:
  print("No")


Fixed code:
k,x = map(int,input().split())
if k*500 >= x :
    print('Yes')
else :
    print('No')
Buggy code:
k, x = map(int, input().split())
if 500*k >= x:
  print("Yes")
  else:
    print("No")

Fixed code:
k, x = list(map(int, input().split()))

if k * 500 >= x:
    print('Yes')
else:
    print('No')
Buggy code:
k,x=input().split()
if 500*k >= x:
  print('Yes')
else:
  print('No')

Fixed code:
k,x = map(int, input().split())

if 500 * int(k) >= int(x):
    print("Yes")
else:
    print("No")
Buggy code:
k,x=map(int,input().split())
if k*500>x:
  print("Yes")
else:
  print("No")


Fixed code:
k, x = list(map(int, input().split()))
if k * 500 >= x:
    print("Yes")
else:
    print("No")
Buggy code:
k,m=map(int,input().split())
c=500*k
if(c<m):
  print("Yes")
else:
  print("No")


Fixed code:
k,m=map(int,input().split())
c=500*k
if(c>=m):
  print("Yes")
else:
  print("No")
Buggy code:
k, x = map(int, input().sprit())
if k*500>=x:
  print('Yes')
else:
  print('No')

Fixed code:
k, x = map(int, input().split())
if k*500>=x:
  print('Yes')
else:
  print('No')
Buggy code:
from functools import lru_cache
import sys

sys.setrecursionlimit(10**8)

K, X = map(int, input().split())

@lru_cache(maxsize=None)
def dp(k,x):
    if k*2 <= x:
        result = 'No'
    else:
        result = 'Yes'
    return result
print(dp(K,X))



Fixed code:
from functools import lru_cache
import sys

sys.setrecursionlimit(10**8)

K, X = map(int, input().split())

@lru_cache(maxsize=None)
def dp(k,x):
    if k*500 < x:
        result = 'No'
    else:
        result = 'Yes'
    return result
print(dp(K,X))
Buggy code:
char = input().split(" ")
if char[0]*500 >= char[1]:
    print("Yes")
else 
    print("No")

Fixed code:
char = input().split(" ")
if int(char[0])*500 >= int(char[1]):
    print("Yes")
else: 
    print("No")
Buggy code:
a,b = int(input().strip().split())
p = 500 * a
if p >= b:
  print("Yes")
else:
  print("No")

Fixed code:
a,b = input().strip().split()
a = int(a)
b = int(b)
p = 500 * a
if p >= b:
  print("Yes")
else:
  print("No")
Buggy code:
k,x = map(int,input())

if 500*k >= x:
  print("Yes")
else:
  print("No")


Fixed code:
k,x = map(int, input().split())
if 500*k >= x:
	print('Yes')
else:
	print('No')
Buggy code:
list = [s for s in input().split()]
if list[0] * 500 >= list[1]:
  print("Yes")
else:
	print("No")

Fixed code:
list = [s for s in input().split()]
if int(list[0]) * 500 >= int(list[1]):
  print("Yes")
else:
	print("No")
Buggy code:
n = 500
x, y = map(int, raw_input().split()) 
if x*n >= y: 
  print("Yes")
else: 
  print("No")

Fixed code:
n = 500
x, y = map(int, input().split())
if x*n >= y: 
    print("Yes")
else: 
    print("No")
Buggy code:
a,b=map(int,input().split())
if  (a * 500) < b:
    print("Yes")
else:
    print("No")
    


Fixed code:
a,b=map(int,input().split())
if  (a * 500) < b:
    print("No")
else:
    print("Yes")
Buggy code:
n.m=map(int,input().split())
if 500*n>=m:
    print("Yes")
else:
    print("No")

Fixed code:
n,k=map(int,input().split())
if 500*n>=k:
    print('Yes')
else:
    print('No')
Buggy code:
k, x = map(int, input().split())
p = k * 500

if p > x:
    print('Yes')
else:
    print('No')

Fixed code:
k, x = map(int, input().split())
p = k * 500

if p >= x:
    print('Yes')
else:
    print('No')
Buggy code:
k, y = map(int, input().split())

if k*500 <= y:
	print("Yes")
else:
	print("No")

Fixed code:
k, y = map(int, input().split())

if k*500 >= y:
	print("Yes")
else:
	print("No")
Buggy code:
def main():
    kx = list(map(int, input().split()))
    if kx[1] >= 500*kx[0]:
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    main()

Fixed code:
def main():
    kx = list(map(int, input().split()))
    if kx[1] <= 500*kx[0]:
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    main()
Buggy code:
import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
# from collections import Counter,defaultdict,deque
# from itertools import permutations, combinations
# from heapq import heappop, heappush
# # input = sys.stdin.readline
# sys.setrecursionlimit(10**8)
# mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

k, x = inpm()
if(500 * k >= k):
    print('Yes')
else:
    print('No')


Fixed code:
import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
# from collections import Counter,defaultdict,deque
# from itertools import permutations, combinations
# from heapq import heappop, heappush
# # input = sys.stdin.readline
# sys.setrecursionlimit(10**8)
# mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

k, x = inpm()
if(500 * k >= x):
    print('Yes')
else:
    print('No')
Buggy code:
ip = input().split()
n = ip[0]
k = ip[1]
if n * 500 >= k:
    print("Yes")
else:
    print("No")

Fixed code:
ip = input().split()
n = int(ip[0])
k = int(ip[1])
if n * 500 >= k:
    print("Yes")
else:
    print("No")
Buggy code:
K, X = map(int(input().split())

if 500*K >= X:
  print("Yes")
else:
  print("No")

Fixed code:
K,X=map(int, input().split())
T=K*500
if T>=X:
  print('Yes')
else:
  print('No')
Buggy code:
import sys
k, x = map(int, sys.stdin.readline())
if k*500 >= x:
  print('Yes')
else:
  print('No')

Fixed code:
import sys
k, x = map(int, sys.stdin.readline().split())
if k*500 >= x:
  print('Yes')
else:
  print('No')
Buggy code:
k. x = map(int, input().split())
if k*500 >= x:
  print('Yes')
else:
  print('No')

Fixed code:
k,x=map(int,input().split())
if x<=500*k:
  print('Yes')
else:
  print('No')
Buggy code:
K, X = input().split()
if K*500<X:
  print('No')
else:
  print('Yes')
  

Fixed code:
K,X=map(int,input().split())
if X<=500*K:
  print("Yes")
else:
  print("No")
Buggy code:
line = input()

k, x = line.split(' ')

if k * 500 >= x:
  print('Yes')
else:
  print('No')

Fixed code:
line = input()
 
k, x = line.split(' ')
k = int(k)
x = int(x)

if k * 500 >= x:
  print('Yes')
else:
  print('No')
Buggy code:
x = [x for x in input().split()]
print('Yes') if x[0]*500>x[1] else print('No')

Fixed code:
x = [int(x) for x in input().split()]
print('Yes') if x[0]*500>=x[1] else print('No')
Buggy code:
f,n = map(int,input().split())
print('Yes' if n >= f*500 else 'No')

Fixed code:
f,x = map(int,input().split())
print('Yes' if f*500 >=x else 'No')
Buggy code:
K,X = input().split()
res=int(K)*500
if(res>int(X)):
    print("Yes")
else:
    print("No")

Fixed code:
K,X=map(int,input().split())

if(K*500>=X):
    print("Yes")
else:
    print("No")
Buggy code:
k,x = map(int,input().split())
if k*500 == x:
  print("Yes")
else:
  print("No")

Fixed code:
k, x = map(int, input().split(' '))
if k*500 >= x:
    print('Yes')
else:
    print('No')
Buggy code:
a,b = input().split()
if 500 * int(a) <= int(b):
    print('Yes')
else:
    print('No')

Fixed code:
a,b = input().split()
if 500 * int(a) >= int(b):
    print('Yes')
else:
    print('No')
Buggy code:
import sys
stdin=sys.stdin

ns=lambda:stdin.readline().rstrip()
ni=lambda:int(stdin.readline().rstrip())
nm=lambda:map(int,stdin.readline().rstrip())
nl=lambda:list(map(int,stdin,readline().rstrip()))

K,X=nm()
print('Yes' if X<=500*K else 'No')

Fixed code:
import sys
stdin = sys.stdin

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))

K,X=nm()
print('Yes' if X<=500*K else 'No')
Buggy code:
K, X = map(int, input().split())
K2 = K*500
if K2 > X:
    print("Yes")
else:
    print("No")

Fixed code:
K,X=map(int,input().split())
print("Yes" if K*500>=X else "No")
Buggy code:
if __name__ == "__main__":
    x = int(input())
    m, n = map(int, input().split())
    if m * 500 >= n:
        print("Yes")
    else:
        print("No")


Fixed code:
if __name__ == "__main__":
    m, n = map(int, input().split())
    if m * 500 >= n:
        print("Yes")
    else:
        print("No")
Buggy code:
 k, x = map(int, input().split())
 if 500 * k >= x:
  print('Yes')
 else:
  print('No)

Fixed code:
k, x = map(int, input().split())
print("Yes") if 500 * k >= x else print("No")
Buggy code:
from sys import stdin
K, X = [int(x) for x in stdin.readline().rstrip().split()]

if X >= K*500:
    print("Yes")
else:
    print("No")

Fixed code:
from sys import stdin
K, X = [int(x) for x in stdin.readline().rstrip().split()]

if X <= K*500:
    print("Yes")
else:
    print("No")
Buggy code:
A=input().split()
if int(A[0])*500 => int(A[1]):
  print('Yes')
else:
  print('No')

Fixed code:
A = input().split()
if 500 * int(A[0]) >= int(A[1]):
  print('Yes')
else:
  print('No')
Buggy code:
K, X = map(int, input().split())
print("Yes" if 500*K>X else "No")

Fixed code:
K, X = map(int, input().split())
print("No" if 500*K<X else "Yes")
Buggy code:
K, X = map(int,input().split)
if 500*K >= X:
  print("Yes")
else:
  print("No")

Fixed code:
K,X = map(int, input().split())
if 500*K >= X:
    print("Yes")
else:
    print("No")
Buggy code:
k , x = map(int,input().split())
if k * 500 >= x:
    print("Yes")
else:
    print("NO")

Fixed code:
k,x=map(int,input().split())

if 500*k>=x:
    print('Yes')
else:
    print('No')
Buggy code:
a = input().split()
print(a)
print(a[0])
K = int(a[0])
X = int(a[1])
if 500 * K >= X:
    print('Yes')
else:
    print('No')

Fixed code:
a = input().split()
K = int(a[0])
X = int(a[1])
if 500 * K >= X:
    print('Yes')
else:
    print('No')
Buggy code:
K,X = map(int, input().split())
if K*500 > X:
	print('Yes')
else:
	print('No')

Fixed code:
K,X = map(int, input().split())
if K*500 >= X:
	print('Yes')
else:
	print('No')
Buggy code:
a,b=map(int,input().split())

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

Fixed code:
a,b=map(int,input().split())
if a*500>=b:
    print("Yes")
else:
    print("No")
Buggy code:
a,b=map(int,input().split())
if 500 * a >= b:
  print("Yes")
else
print("No")

Fixed code:
a,b=map(int,input().split())
if 500 * a >= b:
  print("Yes")
else:
  print("No")
Buggy code:
K, X = map(int, input().split())
if 500*K >= X:
  print("Yes")
else;
  print("No")

Fixed code:
K,X = input().split()
K,X = int(K),int(X)
if(500*K>=X):
  print("Yes")
else:
  print("No")
Buggy code:
k, x = map(int, input().split())

if 500 * k > x:
  print('Yes')
else:
  print('No')

Fixed code:
k, x = map(int, input().split())
 
if 500 * k >= x:
  print('Yes')
else:
  print('No')
Buggy code:
k,x=map(int,input().split())
if (k*500>x):
    print("Yes")
else:
    print("No")

Fixed code:
k,x = map(int,input().split())

if 500*k>=x:
    print('Yes')
else:
    print('No')