#include using namespace std; using uint = unsigned int; using ll = long long; #define CIN( LL , A ) LL A; cin >> A #define GETLINE( A ) string A; getline( cin , A ) #define GETLINE_SEPARATE( A , SEPARATOR ) string A; getline( cin , A , SEPARATOR ) #define FOR_LL( VAR , INITIAL , FINAL_PLUS_ONE ) for( ll VAR = INITIAL ; VAR < FINAL_PLUS_ONE ; VAR ++ ) #define FOR_ITR( ARRAY , ITR , END ) for( auto ITR = ARRAY .begin() , END = ARRAY .end() ; ITR != END ; ITR ++ ) #define REPEAT( HOW_MANY_TIMES ) FOR_LL( VARIABLE_FOR_REPEAT , 0 , HOW_MANY_TIMES ) #define RETURN( ANSWER ) cout << ( ANSWER ) << endl; return 0 #define DOUBLE( PRECISION , ANSWER ) cout << fixed << setprecision( PRECISION ) << ( ANSWER ) << endl; return 0 #define MIN( A , B ) A < B ? A : B; #define MAX( A , B ) A < B ? B : A; template inline T Distance( const T& a , const T& b ){ return a < b ? b - a : a - b; } int main(){ CIN( ll , N ); CIN( ll , X ); CIN( ll , M ); ll A[200000]; FOR_LL( i , 0 , N ){ cin >> A[i]; } ll count = 0; FOR_LL( i , 0 , N ){ ll count_copy = count; ll j = N - 1 - i; ll& Aj = A[j]; while( Aj >= X && count_copy > 0 ){ Aj /= 2; count_copy--; } while( Aj >= X ){ Aj /= 2; count++; M -= j + 1; } if( M < 0 ){ RETURN( "No" ); } } RETURN( "Yes" ); }