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())
print('Yes') if k*500>=x 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 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):
inputs = input().split()
k = int(inputs[0])
x = int(inputs[1])
if 500 * k >= x:
  print("Yes")
else:
  print("No")

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

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

Solution (Python):
H = list(map(int, input().split()))
K = H[0]
X = H[1]
Y = 500*K
if Y>=X:
    ans="Yes"
else:
    ans="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):
inp = str(input()).split(" ")
if(int(inp[0])*500 < int(inp[1])):
    print("No")
else:
    print("Yes")

Solution (Python):
import sys


stdin = sys.stdin

ri = lambda: int(rs())
rl = lambda: list(map(int, stdin.readline().split())) 
rs = lambda: stdin.readline().rstrip()  

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

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

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

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

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

def gcd(a: int, b: int):
    """ https://cocodrips.hateblo.jp/entry/2014/03/05/143623
    """
    while b:
        a, b = b, a%b
    return a

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


def main():
    
    K,X = map(int, input().split())
    
    S = input().rstrip()
    
    
    print("Yes" if X<=500*K else "No")
    


if __name__ == "__main__":
    main()

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):
[k, x] = [int(x) for x in input().split()]
print("Yes") if 500*k >= x 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=list(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):



def main():
    coins, test = map(int, input().split(" "))
    if 500 * coins >= test:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

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 = map(int, input().split())
if x <= k * 500:
    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] = [int(x) for x in input().split()]
if K * 500 >= X:
    print('Yes')
else:
    print('No')

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

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

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


if __name__ == "__main__":
    main()

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

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

else:
  print('No')

Solution (Python):
N ,M = map(lambda x: int(x),input().split())
ans="No"
if N*500>=M:
  ans="Yes"
print(ans)

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

if value < x:
    print("No")
else:
    print("Yes")

Solution (Python):
from collections import defaultdict, deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys
import random
import itertools
import math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt


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


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


def LI_(): return list(map(lambda x: int(x)-1, input().split()))


def II(): return int(input())


def IF(): return float(input())


def LS(): return list(map(list, input().split()))


def S(): return list(input().rstrip())


def IR(n): return [II() for _ in range(n)]


def LIR(n): return [LI() for _ in range(n)]


def FR(n): return [IF() for _ in range(n)]


def LFR(n): return [LI() for _ in range(n)]


def LIR_(n): return [LI_() for _ in range(n)]


def SR(n): return [S() for _ in range(n)]


def LSR(n): return [LS() for _ in range(n)]


def gcd(x, y):
    if y == 0:
        return x
    return gcd(y, x % y)


def my_index_multi(l, x):
    return [i for i, _x in enumerate(l) if _x == x]


def sosu(x):
    for i in range(2, int(sqrt(x)+1)):
        if x % i == 0:
            return False
    return True


mod = 1000000007
inf = float('INF')


def A():
    K, X= LI()

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


    return




def B():
    A, B, K = LI()
    temp = A-K
    if temp >= 0:
        print(temp, B)
        return
    B = B+temp
    if B <= 0:
        print(0, 0)
        return
    else:
        print(0, B)

    return




def true():
    S = input()
    S = S[:-1]

    tmp = 0
    for x in range(1 << (len(S)-1)):
        func = S[-1]
        for i in range(len(S)-1):
            if(x & (1 << i)):
                tmp += int(func)
                func = S[-2-i]
            else:
                func = S[-2-i]+func
        tmp += int(func)
    print(tmp)

    return


def flagcounter(x):
    if (x == 0):
        return 0
    return flagcounter(x >> 1)+(x & 1)


def C():
    X = II()
    if X == 2:
        print(2)
        return
    while(1):
        if sosu(X):
            print(X)
            return
        X += 1

    return



def D():
    N, K = LI()
    R, S, P = LI()
    T=list(input().rstrip())
    ans = 0
    for j in range(K):
        if T[j] == 'r':
            ans += P
        if T[j] == 'p':
            ans += S
        if T[j] == 's':
            ans += R
    j = 0
    rps=['r','p','s']

    for i in range(K, N):
        if T[j] == T[i]:
            if i+K>=N:
                j += 1
                continue
            T[i]=rps[rps.index(T[i+K])-1]
            j += 1
            continue
        if T[i] == 'r':
            ans += P
        if T[i] == 'p':
            ans += S
        if T[i] == 's':
            ans += R
        j += 1
    print(ans)
    return


def Dsyakutori():

    N, K = LI()
    A = LI()
    MAX = sum(A)
    if MAX < K:
        print(0)
        return
    Temp = MAX
    ans = 1
    for i in range(N):
        Temp = Temp-A[i]
        if (Temp >= K):
            ans += 1
        else:
            T = Temp+A[i]
            break
    Temp = T
    ckeep = N
    for k in range(N):
        c = N-1
        i -= 1
        Temp = T

        for j in range(N):
            Temp = Temp-A[c]
            if (Temp >= K):
                ans += 1

            elif(c < ckeep and i >= 0):
                ans += i
                ckeep = c
                break
            else:
                ckeep = c
                break
            c -= 1
        if i < 0:
            break
        T = T+A[i]
    print(ans)

    return




def E():
    N, M= LI()
    A = LI()
    A.sort(reverse=True)
    B=[0]*(N+1)
    for i in range(1,N+1):
        B[i]=B[i-1]+A[i-1]
    D=[0]*(2*10**5+1)
    for i in range(N):
        D[A[i]]+=1
    for i in range(len(D)-1,0,-1):
        D[i-1]+=D[i]
    l=-1
    r=2*10**5+1
    while r-l>1:
        m=(l+r)//2
        s=0
        for i in range(N):
            s+=D[max(1,m-A[i])]
        if s>=M:
            l=m
        else:
            r=m
    ans=0
    s=0
    for i in range(N):
        v=max(0,r-A[i])
        t=max(0,min(D[v],M-s))
        ans+=B[t]+t*A[i]
        s+=t
    ans+=l*(M-s)
    print(ans)

    
    return




def F():
    N, M = LI()

    value = [0] * M
    power = [0] * M
    for i in range(M):
        a, b = LI()
        value[i] = a
        c = LI()
        L = ['0'] * N
        for k in c:
            L[k - 1] = '1'
        bint = ''.join(L)
        power[i] = int(bint, 2)
    bint = ''.join(list(['1'] * N))
    dp = [inf] * (int(bint, 2)+1)
    t = 0
    cost = 0

    dp[0] = 0
    for s in range(int(bint, 2) + 1):
        for i in range(M):
            t = s | power[i]
            cost = dp[s] + value[i]
            dp[t] = min(dp[t], cost)
    print(-1) if(dp[-1] == inf) else print(dp[-1])

    return

    



def solution(S):
    
    N = len(S)

    pass



if __name__ == '__main__':

    A()

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

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 500*K >= X:
    print('Yes')
else:
    print("No")

Solution (Python):
from sys import stdin


def main():
    input = lambda: stdin.readline()[:-1]
    K, X = map(int, input().split())
    if 500 * K >= X:
        print('Yes')
    else:
        print('No')


main()

Solution (Python):
K, X = [int(x) for x in 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):
from sys import stdin

K, X = [int(x) for x in stdin.readline().rstrip().split()]

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

Solution (Python):
k, x = list(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 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 k * 500 >= 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 x<=k*500:
    print("Yes")
else:
    print("No")

Solution (Python):
[k, x] = [int(x) for x in input().split()]
print("Yes") if 500*k >= x 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("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 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):

import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
write = sys.stdout.write
def ii(): return int(readline())
def mi(): return map(int, readline().rstrip().split())
def li(): return list(readline().rstrip())
def lmi(): return list(map(int, readline().rstrip().split()))
def end(*arg): print(*arg); sys.exit()



def main():
    k, x = mi()
    if 500 * k >= x:
        print("Yes")
    else:
        print("No")
    return


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

tot = K * 500

if tot >= X:
    print('Yes')
else:
    print('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())

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

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

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

Solution (Python):
K, X = list(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):


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


if(n[0]*500<n[1]):
    print("No")
else:
    print("Yes")

Solution (Python):
a,b = input().split()

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

Solution (Python):
from sys import stdin

def fetch_one_line():
    return stdin.readline().rstrip()
  
def fetch_int_input():
    return [int(s) for s in fetch_one_line().split()]
  
K, X = fetch_int_input()

answer = ["No", "Yes"]
print(answer[int(500 * K >= X)])

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 500*K>=X else "No")

Solution (Python):
k, x = [int(_) for _ 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 k * 500 >= x:
    print('Yes')
else:
    print('No')

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

if money >= x:
  print("Yes")
else:
  print("No")

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

Solution (Python):
K,X = map(int,input().split())
if K*500 < X:
    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 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, open(0).read().split())
if K*500 >= X:
  print('Yes')
else:
  print('No')

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

Solution (Python):
K,X=map(int,input().split())
print('Yes' if X<=K*500 else '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 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 = [int(i) for i in input().split()]

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

Solution (Python):
input1 = input()
K = int(input1.split()[0])
X = int(input1.split()[1])

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):
IN = input().split()
K, X = int(IN[0]), int(IN[1])

M = K * 500

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

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

Solution (Python):
given_input = input().split()

K = int(given_input[0])
X = int(given_input[1])

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

Solution (Python):
A1,A2=map(int,input().split())
if A1*500 >= A2:
    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('No')
else:
  print('Yes')

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

res = "Yes" if k * 500 >= x else "No"

print(res)

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

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

money = x * 500

if money >= y :
    print('Yes')
else:
    print('No')

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

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


if __name__ == '__main__':
    solve()

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

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

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

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

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

Solution (Python):
K,X = map(int,input().split())
if K*500 > X-1:
  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= list(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 X <= K * 500:
    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 k*500>=x else "No")

Solution (Python):
n=list(map(int,input().split()))
a=n[0]
b=n[1]
if 500*a>=b:
  print("Yes")
else:
  print("No")

Solution (Python):
n = input().split()

if(500*int(n[0]) >= int(n[1])):
  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,N = map(int, input().split())

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

Solution (Python):
s=input().split()
y=int(s[0])*500
if y>=int(s[1]):
  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())

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

Solution (Python):
from sys import stdin
lines = stdin.readlines()
 
K, X = map(int, lines[0].split())

S = 500 * K

if S >= 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()))
ans = "Yes" if 500 * k >= x else "No"

print(ans)

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):
K,X=map(int,input().split())
if X<=500*K:
  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('YNeos'[500 * k < x::2])

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())
ans = 'No'
if (K * 500 >= X):
    ans = 'Yes'
print(ans)

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

K, X = map(int, ip().rstrip().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("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 = map(int, input().split())
print("Yes" if 500*k>=x else "No")

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

Solution (Python):
n,k=map(int,input().split())
g=500*n
if g>=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):
import collections


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

Solution (Python):
inputA,inputB =map(int, input().split(' '))



if inputA * 500 >= inputB:
    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):

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=map(int,input().split())
print('Yes' if 500*k>=x else 'No')

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

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

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

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

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

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

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

Solution (Python):
A, B = map(int, input().split())

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

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

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

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

T = 500 * K

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

Solution (Python):


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


if __name__ == '__main__':
    main()

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

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

Solution (Python):
K, X = [int(n) for n in 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 = map(int,input().split())
if k*500 >= x :
    print('Yes')
else :
    print('No')

Solution (Python):

import math



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

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

Solution (Python):
li = list(map(int, input().split()))
if 500*li[0]>=li[1]:
    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 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 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):
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):
a,b = map(int,input().split())
if a*500 <b:
    print('No')
else:
    print('Yes')

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


import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

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

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

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

K = int(K) * 500

if (int(K) >= int(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")
  exit()
print("No")

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

Solution (Python):
import sys

def resolve():
    input = sys.stdin.readline
    K,X=map(int,input().rstrip().split())
     
    if K*500>=X:
        print("Yes")
    else:
        print("No")

import sys
from io import StringIO
import unittest

class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)
    def test_入力例_1(self):
        input = """2 900"""
        output = """Yes"""
        self.assertIO(input, output)
    def test_入力例_2(self):
        input = """1 501"""
        output = """No"""
        self.assertIO(input, output)
    def test_入力例_3(self):
        input = """4 2000"""
        output = """Yes"""
        self.assertIO(input, output)

if __name__ == "__main__":
    
    resolve()

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

Solution (Python):
import sys

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

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

Solution (Python):
import sys
sys.setrecursionlimit(4100000)

import math

import logging

logging.basicConfig(level=logging.DEBUG)

logger = logging.getLogger(__name__)


def resolve():
    K, X = [int(x) for x in sys.stdin.readline().split()]

    logger.debug('{}'.format([K, X]))

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


if __name__ == "__main__":
    resolve()




import sys
from io import StringIO
import unittest


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """2 900"""
        output = """Yes"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """1 501"""
        output = """No"""
        self.assertIO(input, output)

    def test_入力例_3(self):
        input = """4 2000"""
        output = """Yes"""
        self.assertIO(input, output)

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