#include <iostream>

using namespace std ;

int n,c,p[ 1001 ],p1[ 1001 ],p2[ 1001 ],b,trazi,i ;

int main ( void ) {
    cin >> n >> c ;
    for ( int j = 0 ; j < n ; j++ ) cin >> p[ j ] ;
    while ( i < n ){
        b = 0 ;
        trazi = p[ 1 ] ;
        for ( int j = 0 ; j < n ; j++ ) {
            if ( p[ j ] == trazi ) {
                    b++ ;
                    for ( int k = 0 ; k < n ; k++ ) {
                            if ( k != j ) p2[ k ] = p[ k ] ;
                    }
                    n-- ;
                    for ( int k = 0 ; k < n ; k++ ) p[ i ] = p2[ i ] ;
                    p[ n+1 ] = '\0' ;
            }
        }
        for ( int j = 0 ; j < b ; j++ ) {
            p1 [ i ] = trazi ;
            i++ ;
        }
    }
    for ( int j = 0 ; j < n ; j++ ) cout << p1[ j ] << ' ' ;
    cout << endl ;
    return 0 ;
}