#include <cstdio>
#include <vector>
#include <algorithm>

#define KONJ 42 - 42

using namespace std;

struct num{
    int value, p, pos;
    friend bool operator < ( num A, num B ){
        if ( A.p == B.p ){ return A.pos < B.pos; }
        return A.p > B.p;
    }
};

int N, C;
int niz[1042];
vector < num > v;

int main( void ){

    scanf( "%d%d", &N, &C );
    for ( int i = 0; i < N; ++i ){
        scanf( "%d", &niz[i] );
    }
    
    for ( int i = 0; i < N; ++i ){
        if ( niz[i] > C ){ continue; }
        int tmp = 0;
        for ( int j = 0; j < N; ++j ){
            if ( niz[j] == niz[i] ){ ++tmp; }
        }
        int _tmp;
        for ( int j = 0; j < N; ++j ){
            if ( niz[j] == niz[i] ){ _tmp = j; break; }
        }
        num nes;
        nes.value = niz[i]; nes.p = tmp; nes.pos = _tmp;
        v.push_back( nes );
    }
    
    sort( v.begin(), v.end() );
    
    for ( int i = 0; i < v.size(); ++i ){
        printf( "%d ", v[i].value );
    } 
    printf( "\n" );

    return KONJ;

}