def sol1(n,x,m,A):
    a=A[:]
    need=[0]*(n+1)
    for i in range(n):
        while a[i]>=x:
            need[i]+=1
            a[i]//=2
    for i in range(n-1,-1,-1):
        need[i]=max(need[i],need[i+1])
    if sum(need)<=m:return "Yes"
    return "No"
n,x,m=map(int,input().split())
a=list(map(int,input().split()))
print(sol1(n,x,m,a))