#include <iostream>
#include <algorithm>
#define max 100000
using namespace std;

int main () {
             
             int n, c; cin >> n >> c;
             
             int i, bro, j, f; long br [max], b [max] = {0}, p [max] = {0};
             for (i = 0 ; i < n ; i++) {
                                        
                                        cin >> br [i];
                                        
                                        }
             cout << endl;
             for (i = 0 ; i < n ; i++) {
                                        
                                        bro = 0;
                                        for (j = 0 ; j < n ; j++) {
                                                                   
                                                                   if (br [i] != b [j]) ++bro;
                                                                   
                                                                   }
                                        
                                        if (bro == n) {
                                                       
                                                       for (j = 0 ; j < n ; j++) {
                                                                                  
                                                                                  if (b [j] == 0) { b [j] = br [i]; break; }
                                                                                  
                                                                                  }
                                                       
                                                       }
                                        
                                        }
             
             for (i = 0 ; i < n ; i++) {
                                        f = i;
                                        
                                        for (j = 0 ; j < n ; j++) {
                                                                   
                                                                   if (b [i] == br [j]) ++p [f];
                                                                   
                                                                   }
                                        
                                        }
             
             int pom;
             for (i = 0 ; i < n ; i++) {
                                        
                                        for (j = 0 ; j < n -1 ; j++) {
                                                                       
                                                                       if (p [j] < p [j + 1]) {
                                                                                               
                                                                                               swap(b[j], b[j+1]);
                                                                                               swap(p[j], p[j+1]);
                                                                                               
                                                                                               }
                                                                       
                                                                       }
                                        
                                        }
             for (i = 0 ; i < n; i++) {
                                       
                                       for (j = 0 ; j < p [i] ; j++) {
                                                                      
                                                                      cout << b [i] << " ";
                                                                      
                                                                      }
                                       
                                       }
             
             return 0;
             }