import java.util.LinkedList;
import java.util.List;
import java.util.Scanner;
import java.util.stream.Collectors;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int m = in.nextInt(), n = in.nextInt();
int plants[] = new int[n];
for(int i = 0; i < n; i++){
plants[i] = in.nextInt();
}
LinkedList<Integer> queue = new LinkedList<>();
for(int i = 0; i < n; i++){
if(!queue.contains(plants[i])){//第i个植物未种植
queue.addLast(plants[i]);
if(queue.size() > m){//维持花盆数为m
queue.removeFirst();
}
}else{//第i个植物已种植
int index = queue.indexOf(plants[i]);
queue.remove(index);
queue.addLast(plants[i]);
}
}
List<Integer> plantsList = queue.stream().sorted().collect(Collectors.toList());
for(Integer plant: plantsList){
System.out.print(plant+" ");
}
System.out.println();
}
}