Problem:
 Score : 100 points    Problem Statement Takahashi has K  500 -yen coins. (Yen is the currency of Japan.)
If these coins add up to X yen or more, print Yes ; otherwise, print No .      Constraints  1 \leq K \leq 100  1 \leq X \leq 10^5         Input Input is given from Standard Input in the following format:  K  X       Output If the coins add up to X yen or more, print Yes ; otherwise, print No .        Sample Input 1 2 900      Sample Output 1 Yes  Two 500 -yen coins add up to 1000 yen, which is not less than X = 900 yen.       Sample Input 2 1 501      Sample Output 2 No  One 500 -yen coin is worth 500 yen, which is less than X = 501 yen.       Sample Input 3 4 2000      Sample Output 3 Yes  Four 500 -yen coins add up to 2000 yen, which is not less than X = 2000 yen.

Solution (Python):
k,x = map(int,input().split())

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

Solution (Python):
def main():
    K, X = (int(i) for i in input().split())
    if 500*K >= X:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

Solution (Python):
K,X = map(int,input().split())
if 500*K >= X:
    print("Yes")
else:
    print("No")

Solution (Python):
def main():
    k,x = map(int, input().split())

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

if __name__ == '__main__':
    main()

Solution (Python):
K,X=map(int,input().split())
if X <= K * 500:
    print('Yes')
else:
    print('No')

Solution (Python):

"""
Created on Fri Jan 10 20:59:19 2020

@author: masat
"""

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

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

Solution (Python):
import sys
import math
import bisect
stdin = sys.stdin
mod = 10**9 + 7

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
sa = lambda h: [list(map(int, stdin.readline().split())) for i in range(h)]

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

Solution (Python):
K, X = map(int,input().split())
if K*500 >= X:
  print("Yes")
else:
  print("No")

Solution (Python):
K,X = map(int,input().split())
ans = K*500
if ans>=X:
	print("Yes")
else:
	print("No")

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

Solution (Python):
k,x=map(int,input().split())
print('Yes' if k*500>=x else 'No')

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

Solution (Python):


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

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

Solution (Python):
K, Y = map(int, input().split())

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

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline

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


if __name__ == '__main__':
    main()

Solution (Python):
k, x = map(int, input().split())

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

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

Solution (Python):
K,X = map(int,input().split())

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

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

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

Solution (Python):
n, k = map(int, input().split())
if n * 500 >= k:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys
import math
input = sys.stdin.readline


def main():
    sc = Scan()
    K, X = sc.intarr()

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


def dfs(N):
    global dp
    if N <= 0:
        return 1

    if dp[N] > -1:
        return dp[N]
    ans = 0
    for i in range(1, 7):
        ans += dfs(N-i)
    dp[N] = ans
    return ans


class Scan():

    def intarr(self):
        num_array = list(map(int, input().split()))
        return num_array

    def intarr_ver(self, n):
        return [int(input()) for _ in range(n)]

    def strarr(self):
        line = input()
        array = line.split(' ')
        array[-1] = array[-1].strip('\n')
        return array


def display(array):
    for a in range(len(array)):
        if len(array) - a != 1:
            print(array[a], end=' ')
        else:
            print(array[a])


def gcd(a, b):  
    while b:
        a, b = b, a % b
    return a


def lcm(a, b):  
    return a * b // gcd(a, b)


main()

Solution (Python):
K,X = map(int,input().split())
if 500 * K >= X :
    print('Yes')
else :
    print('No')

Solution (Python):
k, x = [ int(v) for v in input().split() ]
print("Yes" if 500*k >= x else "No")

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

Solution (Python):
k,x=map(int,input().split())

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

Solution (Python):
k, x = map(int, input().split())

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

Solution (Python):
k,x = map(int,input().split())
if 500 * k >= x:
    print('Yes')
else:
    print('No')

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

Solution (Python):
words = lambda t : list(map(t, input().split()))
k,x = words(int)
if k*500 >= x:
    print("Yes")
else:
    print("No")

Solution (Python):
K, X = map(int, input().split())

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

Solution (Python):
from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate
import sys
import bisect
import string
import math
import time
from fractions import gcd



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 StoI(): return [ord(i)-97 for i in input()]


def ItoS(nn): return chr(nn+97)


def input(): return sys.stdin.readline().rstrip()


def show(*inp, end='\n'):
    if show_flg:
        print(*inp, end=end)


YN = ['No', 'Yes']
MOD = 10**9+7
inf = float('inf')
IINF = 10**10
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**6)
nums = ['1', '2', '3', '4', '5', '6', '7', '8', '9', '10']

show_flg = False



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

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


if __name__ == '__main__':
    main()

Solution (Python):
K, X = map(int, input().split())
if K*500 >= X:
    print("Yes")
else:
    print("No")

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

Solution (Python):
k,x = map(int,input().split())
result = 0
for i in range(k):
    result += 500

if result >= x:
    print('Yes')
else:
    print('No')

Solution (Python):
def solve():
    K, X = map(int, input().split())
    sm = K * 500

    if sm >= X:
        print('Yes')
    else:
        print('No')
if __name__ == '__main__':
    solve()

Solution (Python):
k, x = map(int, input().split())

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

Solution (Python):
import numpy as np

def main():
    K, X = map(int, input().split())
    if (500 * K) >= X:
        print("Yes")
    else:
        print("No")
    return 0

if __name__ == '__main__':
    main()

Solution (Python):
K,X=map(int, raw_input().split())
if X<=500*K:
    print "Yes"
else:
    print "No"

Solution (Python):
K, X = [int(i) for i in input().split()]
if 500 * K >= X:
    print("Yes")
else:
    print("No")

Solution (Python):
k, x = map(int, input().split())

total = k * 500
ans = "No"

if total >= x:
  ans = "Yes"

print(ans)

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

Solution (Python):
K, X = map(int, input().split())

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

Solution (Python):
K, X  = map(int, input().split())
if K*500>= X:
    print('Yes')
else:
    print('No')

Solution (Python):
import numpy as np

K, X = [int(i) for i in input().split()]

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

Solution (Python):
K, X = [int(i) for i in input().split(" ")]

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

Solution (Python):
K,X = map(int, input().split())

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

Solution (Python):
k,x=map(int,input().split())
print('Yes' if k*500>=x else 'No')

Solution (Python):
K,X=map(int,input().split())
if 500*K>=X:
    print("Yes")
else:
    print("No")

Solution (Python):
import numpy as np


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

Solution (Python):
K,X = map(int,input().split())
if 500 * K >= X :
    print("Yes")
else:
    print("No")

Solution (Python):
k, x = map(int, input().split())

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

Solution (Python):
k, x = [int(x) for x in input().split()]
if k*500 >= x:
    print('Yes')
else:
    print('No')

Solution (Python):
K, X = map(int, input().split())

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

Solution (Python):
k, x = map(int, input().split(' '))
if k*500 >= x:
    print('Yes')
else:
    print('No')

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

Solution (Python):
K,X = map(int, input().split())

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

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

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

Solution (Python):
k, x = map(int, input().split())

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

Solution (Python):
k, x = map(int, input().split())

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

Solution (Python):
k ,x = [int(i) for i in input().split(" ")]

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

Solution (Python):
k, x = map(int, input().split())

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

Solution (Python):

import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(100000)
input = sys.stdin.readline
INF = 2**62-1

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


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


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(K, X):
    return 'Yes' if 500*K >= X else 'No'


def main():
    K, X = read_int_n()
    print(slv(K, X))


if __name__ == '__main__':
    main()

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

Solution (Python):
K,X=map(int,input().split())
if 500*K >= X:
   print("Yes")
else:
   print("No")

Solution (Python):
k,x=map(int,(input().split()))

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

Solution (Python):
K,X=map(int,input().split())
if 500*K >= X:
    print('Yes')
else:
    print('No')

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

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

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

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
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 [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

def main():
  k,x=LI()

  if k*500>=x:
    return 'Yes'
  return 'No'


print(main())

Solution (Python):

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

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

Solution (Python):
import sys
input = sys.stdin.readline


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


if __name__ == "__main__":
    main()

Solution (Python):
k,x=map(int,input().split())
if 500*k>=x:
    print('Yes')
else:
    print('No')

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

Solution (Python):
k,x=map(int, input().split())
if 500 * k >= x:
    print('Yes')
else:
    print('No')

Solution (Python):
N,K = map(int, input().split())
if N*500 >=K:
    print("Yes")
else:
    print("No")

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

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

Solution (Python):
k,x=[int(j) for j in input().split()]
if 500*k>=x:
    print("Yes")
else:
    print("No")

Solution (Python):
K,X=map(int,input().split())
print(['No','Yes'][K*500>=X])

Solution (Python):
K, X = map(int, input().split())
tmp = K * 500
if tmp >= X:
    print("Yes")
else:
    print("No")

Solution (Python):
K, X = map(int, input().split())
print('Yes' if X <= 500 * K else 'No')

Solution (Python):
K,X=map(int,input().split())
if 500*K>=X:
    print("Yes")
else:
    print("No")

Solution (Python):
K, X = map(int, input().split())
print('Yes' if 500 * K >= X else 'No')

Solution (Python):
k,x = [int(i) for i in input().split()]

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

Solution (Python):
K, X = map(int, input().split())

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

Solution (Python):
K , X = map(int,input().split())
if 500*K >= X:
    print("Yes")
else:
    print("No")

Solution (Python):
K,X = map(int,input().split())
if K*500>= X:
    print('Yes')
else:
    print('No')

Solution (Python):
K, X = map(int, input().split())
ans = 'Yes' if 500*K >= X else 'No'
print(ans)

Solution (Python):
k,x = (int(x) for x in input().split())

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

Solution (Python):
def main():
    K, X = map(int, input().split())

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

if __name__ == "__main__":
    main()

Solution (Python):
k,x = map(lambda x: int(x),input().split())
if 500*k >= x :
    print('Yes')
else :
    print('No')

Solution (Python):
K, X = map(int, input().split())
if K*500 >= X:
    print("Yes")
else:
    print("No")

Solution (Python):
inputs = input().split(" ")
print("Yes" if int(inputs[0])*500 >= int(inputs[1]) else "No")

Solution (Python):
K, X = map(int, input().split())
if X <= 500*K:
    print('Yes')
else:
    print('No')

Solution (Python):
K, X = map(int,input().split())

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

Solution (Python):
K, X = map(int, input().split())
if 500 * K >= X:
    print("Yes")
else:
    print("No")

Solution (Python):
K, X = map(int, input().split())

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

Solution (Python):
K, X = map(int, input().split())
if 500*K >= X:
    print("Yes")
else:
    print("No")

Solution (Python):

import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(100000)
input = sys.stdin.readline
INF = 2**62-1

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


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


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(K, X):
    return 'Yes' if 500*K >= X else 'No'


def main():
    K, X = read_int_n()
    print(slv(K, X))


if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
import numpy as np

def main():
    K, X = map(int, input().split())
    if (500 * K) >= X:
        print("Yes")
    else:
        print("No")
    return 0

if __name__ == '__main__':
    main()

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

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

Solution (Python):
K,X=map(int,input().split())
if 500*K>=X:
    print("Yes")
else:
    print("No")

Solution (Python):
k,x = map(int,input().split())

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

Solution (Python):
k, x = map(int, input().split())

total = k * 500
ans = "No"

if total >= x:
  ans = "Yes"

print(ans)

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

Solution (Python):
K,X=map(int, input().split())

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

Solution (Python):
k,x=map(int,input().split())

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

Solution (Python):
K, X = map(int, input().split())
if K * 500 >= X:
    print('Yes')
else:
    print('No')

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)

k, x = map(int, readline().split())

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

Solution (Python):
k,x=map(int,(input().split()))

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

Solution (Python):


[K, X] = [int(i) for i in input().split()]

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

Solution (Python):
k,x = map(int,input().split())

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

Solution (Python):
K, X = map(int, input().split())
print('Yes' if 500 * K >= X else 'No')

Solution (Python):
K,X = map(int,input().split())
if 500*K >= X:
    print("Yes")
else:
    print("No")

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

Solution (Python):
K, X = map(int, input().split())
print('Yes' if 500 * K >= X else 'No')

Solution (Python):
k, x = map(int, input().split())
if 500*k < x:
    print("No")
else:
    print("Yes")

Solution (Python):
K,N = map(int,input().split())
if K * 500 >= N:
  print("Yes")
else:
  print("No")

Solution (Python):
K, X = map(int, input().split())

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

Solution (Python):
K,X=map(int,input().split())
print("Yes" if (500*K>=X) else "No")

Solution (Python):
k,x = map(int,input().split())
if 500*k < x:
  print("No")
else:
  print("Yes")

Solution (Python):
a, x = map(int,input().split())

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

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

Solution (Python):

k, x = map(int, input().split())


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

Solution (Python):
K,X = map(int,input().split())
print("Yes" if K*500>=X else "No")

Solution (Python):
k, x = list(map(int, input().split()))
if k * 500 >= x:
  print('Yes')
else:
  print('No')

Solution (Python):
K, X = [int(i) for i in input().split()]
print('Yes' if 500 * K >= X else 'No')

Solution (Python):
K,X = map(int,input().split())
if 500*K >= X:
    print("Yes")
else:
    print("No")

Solution (Python):
k,x=map(int, input().split())
if 500*k >=x:
  print('Yes')
else:
  print('No')

Solution (Python):
K, X = map(int, input().split())
if 500*K >= X:
    print("Yes")
else:
    print("No")

Solution (Python):
K,X = map(int,input().split())
if 500*K >= X:
    print('Yes')
else:
    print('No')

Solution (Python):
k,x = map(int,input().split())
if 500 * k >= x:
    print('Yes')
else:
    print('No')

Solution (Python):
K, X = map(int, input().split())
if K * 500 >= X:
    print("Yes")
else:
    print("No")

Solution (Python):
k,x=map(int,input().split())
if 500*k>=x:
  print('Yes')
else:
  print('No')

Solution (Python):
k, x = map(int, input().split())

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

Solution (Python):
K,X=map(int,input().split())
if K*500>=X:
  print("Yes")
else:
  print("No")

Solution (Python):
k,x=[int(i) for i in input().split()]
print("Yes" if k*500>=x else "No")

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

Solution (Python):

import sys
INF = float("inf")


def yes():
    print("Yes")  


def no():
    print("No")  


def solve(K: int, X: int):
    if 500*K >= X:
        yes()
    else:
        no()

    return


def main():

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    K = int(next(tokens))  
    X = int(next(tokens))  
    solve(K, X)


if __name__ == '__main__':
    main()

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

Solution (Python):
K, X = map(int, input().split())

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

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

Solution (Python):


import sys
sys.setrecursionlimit(300000)

YES = "Yes"  
NO = "No"  

def solve(K: int, X: int):
    if 500 * K >= X:
        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()
    K = int(next(tokens))  
    X = int(next(tokens))  
    solve(K, X)

if __name__ == '__main__':
    main()