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

Solution (Python):
from sys import stdin
import numpy as np




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

Solution (Python):
def main():
    import sys
    K,X=list(map(int,sys.stdin.readline().split()))
    if 500*K>=X:
        print('Yes')
    else:
        print('No')
    

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

Solution (Python):
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    k, x = list(map(int, readline().split()))
    print("Yes" if k * 500 >= x else "No")


if __name__ == '__main__':
    solve()

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

p = 500*k

if(p>=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(v) for v in input().split()]

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

Solution (Python):

MOD = 10 ** 9 + 7

import math

import itertools



def sosuhante(n):
    for k in range(2, int(math.sqrt(n))+1):
        if n% k ==0:
            return False
    return True
def cmb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2,r+1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p-1,r,p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

def kingaku(a,b,n):
    keta=len(str(n))
    return a*n+b*keta

def my_index(l, x, default=False):
    if x in l:
        return l.index(x)
    else:
        return default




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




if __name__ == "__main__":
    main()

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

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

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

Solution (Python):
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def gcd(a,b): 
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

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

def divisors(a): 
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): 
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): 
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def prime_fact(a): 
    sqrt = math.sqrt(a)
    res = []
    i = 2
    if is_prime(a):
        res.append(a)
    else:
        while a!=1:
            while a%i==0:
                res.append(i)
                a //= i
            i += 1
    return res

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

if __name__=='__main__':
    main()

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

Solution (Python):
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())
i = 500 * k
if i >= x:
    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 = 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("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 = 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):
from sys import stdin
import math

a,b = [int(x) for x in stdin.readline().rstrip().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):
import sys
from fractions import gcd
from itertools import groupby as gb
from itertools import permutations as perm
from itertools import combinations as comb
from collections import Counter as C
from collections import defaultdict as dd
sys.setrecursionlimit(10**5)
def y(f):
    if f:
        print('Yes')
    else:
        print('No')
def Y(f):
    if f:
        print('YES')
    else:
        print('NO')
def Z(f):
    if f:
        print('Yay!')
    else:
        print(':(')
def ispow(n):
    if int(n**.5)**2==n:
        return True
    return False

a,b = map(int,input().split())
y(a * 500 >= b)

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

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):
import sys
input = sys.stdin.readline

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

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

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

Solution (Python):
a, b = map(int, input().split())
a *= 500

if a >= b:
    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())
print('Yes' if 500*k>=x else 'No')

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

if 500 * K >= N:
    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, n = map(int, input().split())
if k*500 >= n:
    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 num():
    return int(input())
def nums():
    return list(map(int,input().split()))

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

Solution (Python):

import sys

YES = "Yes"  
NO = "No"  


def solve(K: int, X: int):
    if K*500 >= X:
        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()
    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 500*k >= x:
  print("Yes")
else:
  print("No")

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

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

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

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

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

Solution (Python):
K,X = list(map(int, input().split()))
A = 500*K 
if A >= 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():

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


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

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

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

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

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

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

Solution (Python):
import sys,math,string,bisect
input=sys.stdin.readline
from collections import deque,defaultdict
L=lambda : list(map(int,input().split()))
Ls=lambda : list(input().split())
M=lambda : map(int,input().split())
I=lambda :int(input())
S=lambda :input().strip()
n,m=M()
if(n*500<m):
    print("No")
else:
    print("Yes")

Solution (Python):
def main():
    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 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):
a,b=map(int,input().split())

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

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

Solution (Python):
import sys
input = sys.stdin.readline
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())
ans = "Yes"if k*500 >=x else "No"
print(ans)

Solution (Python):

import sys

YES = "Yes"  
NO = "No"  


def solve(K: int, X: int):
    print(YES if K*500>=X 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 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 print("No")

Solution (Python):
k,x=map(int,input().split())
print("YNeos"[500*k<x::2])

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

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

Solution (Python):











import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,hypot,log 
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    K,X = MI()
    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):
from collections import Counter,defaultdict,deque
import sys
import bisect
import math
import itertools
import string
import queue
import copy


from itertools import permutations, combinations
from heapq import heappop, heappush

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

def main():
    k,x = inpm()
    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):

import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1

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):
import math
import itertools
import fractions
import heapq
import collections
import bisect
import sys

sys.setrecursionlimit(10**9)
mod = 998244353
inf = 10**20

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

k,x = LI()

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

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

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

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

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 sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
from bisect import bisect

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

K, X = MAP()

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

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

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

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

if m<=500*n:
    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

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7

K, X = MAP()

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

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

Solution (Python):
x,y = map(int,input().split())
if(500*x >= y):
    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):
x,y=input("").split(" ")
x=int(x)
y=int(y)
if x * 500 < y:
  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())

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

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

if int(K) * 500 >= int(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 = map(int, input().split())

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

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


main()

Solution (Python):
k,x = map(int,raw_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 = [int(i) for i in input().split(" ")]

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

Solution (Python):
N = input().split()
for a in range(len(N)):
    N[a] = int(N[a])

if N[1]/N[0] <= 500:
    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):
import sys
input = sys.stdin.readline
N,K=map(int,input().split())
if 500*N>=K:
    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
k, x = [int(i) for i in sys.stdin.readline().split()]
if k * 500 >= x:
    print("Yes")
else:
    print("No")

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

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

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

ans = "Yes" if 500*k >= x else "No"
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 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 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):
import sys
input = sys.stdin.readline


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


if __name__ == '__main__':
    main()

Solution (Python):
k1, x1 = input().split()

k = int(k1)
x = int(x1)

total = 500 * k

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

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

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):
x,y=map(int,input().split())

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

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

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

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

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

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

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

k = int(k)
x = int(x)

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