Problem: You are given an array s consisting of n integers.

You have to find any array t of length k such that you can cut out maximum number of copies of array t from array s.

Cutting out the copy of t means that for each element t_i of array t you have to find t_i in s and remove it from s. If for some t_i you cannot find such element in s, then you cannot cut out one more copy of t. The both arrays can contain duplicate elements.

For example, if s = [1, 2, 3, 2, 4, 3, 1] and k = 3 then one of the possible answers is t = [1, 2, 3]. This array t can be cut out 2 times. 

  * To cut out the first copy of t you can use the elements [1, \underline{2}, 3, 2, 4, \underline{3}, \underline{1}] (use the highlighted elements). After cutting out the first copy of t the array s can look like [1, 3, 2, 4]. 
  * To cut out the second copy of t you can use the elements [\underline{1}, \underline{3}, \underline{2}, 4]. After cutting out the second copy of t the array s will be [4]. 



Your task is to find such array t that you can cut out the copy of t from s maximum number of times. If there are multiple answers, you may choose any of them.

Input

The first line of the input contains two integers n and k (1 ≤ k ≤ n ≤ 2 ⋅ 10^5) — the number of elements in s and the desired number of elements in t, respectively.

The second line of the input contains exactly n integers s_1, s_2, ..., s_n (1 ≤ s_i ≤ 2 ⋅ 10^5).

Output

Print k integers — the elements of array t such that you can cut out maximum possible number of copies of this array from s. If there are multiple answers, print any of them. The required array t can contain duplicate elements. All the elements of t (t_1, t_2, ..., t_k) should satisfy the following condition: 1 ≤ t_i ≤ 2 ⋅ 10^5.

Examples

Input


7 3
1 2 3 2 4 3 1


Output


1 2 3 


Input


10 4
1 3 1 3 10 3 7 7 12 3


Output


7 3 1 3


Input


15 2
1 2 1 1 1 2 1 1 2 1 2 1 1 1 1


Output


1 1 

Note

The first example is described in the problem statement.

In the second example the only answer is [7, 3, 1, 3] and any its permutations. It can be shown that you cannot choose any other array such that the maximum number of copies you can cut out would be equal to 2.

In the third example the array t can be cut out 5 times.

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;

public class D {
	
    //static FastInput k = new FastInput("/home/rajkin/Desktop/input.txt");
    static FastInput k = new FastInput(System.in);
    static FastOutput z = new FastOutput();
    
    static int n, K;
    static int [] freq = new int[((int)1e5 * 2) + 6];
    static ArrayList<Pair> list;
    static ArrayList<Pair> ans;
    
    static Pair [] L, R;
    
    static boolean isPossible(int possibleAns){
    	ArrayList<Pair> temp = new ArrayList<Pair>();
    	int count = 0;
    	
    	for(int i = 0; i<list.size(); i++){
    		Pair p = list.get(i);
    		if(p.freq >= possibleAns){
    			int currentCount = (p.freq / possibleAns);
    			count += currentCount;
    			
    			if(count < K){
    				temp.add(new Pair(p.value, currentCount));
    			}
    			else if(count == K) {
    				temp.add(new Pair(p.value, currentCount));
    				break;
    			}
    			else{
    				temp.add(new Pair(p.value, currentCount - (count - K)));
    				break;
    			}
    		}
    	}
    	
    	if(count >= K){
    		ans = temp;
    	}
    	
    	return count >= K;
    }
    
    static void startAlgorithm(){
    	int low = 1;
    	int high = n;
    	
    	while(low <= high){
    		if(low == high){
        		isPossible(low);
        		
    			break;
    		}
    		
    		int mid = (low + high) / 2;
    		if(isPossible(mid)){
    			low = mid + 1;
    		}
    		else{
    			high = mid;
    		}
    	}
    	
    	for(int i = 0; i<ans.size(); i++){
    		Pair p = ans.get(i);
    		while(p.freq-->0){
    			z.print(p.value+" ");
    		}
    	}
    	
    	z.println();
    }
    
    static void merge(ArrayList<Pair> list, int l, int m, int r){
    	int n1 = m-l+1;
    	int n2 = r-m;
    	
    	for(int i = 0; i<n1; i++){
    		L[i] = list.get(l + i);
    	}
    	
    	for(int j = 0; j<n2; j++){
    		R[j] = list.get(m + j + 1);
    	}
    	
    	int i = 0;
    	int j = 0;
    	int k = l;
    	
    	while(i < n1 && j < n2){
    		if(L[i].freq >= R[j].freq){
    			list.set(k, L[i]);
    			i++;
    		}
    		else{
    			list.set(k, R[j]);
    			j++;
    		}
    		
    		k++;
    	}
    	
    	while(i<n1){
			list.set(k, L[i]);
			i++;
			k++;
    	}
    	
    	while(j<n2){
			list.set(k, R[j]);
			j++;
			k++;
    	}
    }
    
    static void mergeSort(ArrayList<Pair> list, int l, int r){
    	if(l < r){
    		int m = l + (r-l) / 2;
    		
    		mergeSort(list, l, m);
    		mergeSort(list, m+1, r);
    		merge(list, l, m, r);
    	}
    }
	
    public static void main(String[] args) throws Exception {
    	while(k.hasNext()){
    		Arrays.fill(freq, 0);
    		list = new ArrayList<Pair>();
    		ans = new ArrayList<Pair>();
    		
    		n = k.nextInt();
    		K = k.nextInt();
    		
    		L = new Pair[n+1];
    		R = new Pair[n+1];
    		
    		for(int i = 0; i<n; i++){
    			int value = k.nextInt();
    			freq[value]++;
    		}
    		
    		for(int i = 0; i<freq.length; i++){
    			if(freq[i] > 0){
    				list.add(new Pair(i, freq[i]));
    			}
    		}
    		
    		//Collections.sort(list);
    		mergeSort(list, 0, list.size()-1);
    		
    		startAlgorithm();
    	}
    	
    	z.flush();
    	System.exit(0);
    }
    
    static class Pair implements Comparable<Pair>{
    	int value;
    	int freq;
    	
    	public Pair(int value, int freq) {
			this.value = value;
			this.freq = freq;
		}

		@Override
		public int compareTo(Pair p) {
			return p.freq - this.freq;
		}
    }
    
    public static class FastInput {
        BufferedReader reader;
        StringTokenizer tokenizer;
 
        public FastInput(InputStream stream){
        	reader = new BufferedReader(new InputStreamReader(stream));
        }
        
	    public FastInput(String path){
	        try {
	        	reader = new BufferedReader(new FileReader(path));
			} catch (FileNotFoundException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
	        tokenizer = null;
	    }
 
        public String next() {
            return nextToken();
        }
        
        public String nextLine() {
            try {
				return reader.readLine();
			} catch (IOException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
            
            return null;
        }
 
        public boolean hasNext(){
            try {
                return reader.ready();
            } catch (IOException e) {
                // TODO Auto-generated catch block
                e.printStackTrace();
            }
            return false;
        }
 
        public String nextToken() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                String line = null;
                try {
                    line = reader.readLine();
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
                if (line == null) {
                    return null;
                }
                tokenizer = new StringTokenizer(line);
            }
            return tokenizer.nextToken();
        }
 
        public Integer nextInt() {
            return Integer.parseInt(nextToken());
        }
       
        public Long nextLong() {
            return Long.valueOf(nextToken());
        }
    }
    
    public static class FastOutput extends PrintWriter {
    	public FastOutput() { 
            super(new BufferedOutputStream(System.out)); 
    	}
    }
}