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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.IOException;
import java.io.Reader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Nathaniel Lahn
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        FastScanner in = new FastScanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskD solver = new TaskD();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskD {
        int k;
        int[] counts;
        public LongPredicate test = new LongPredicate() {


            public boolean success(long guess) {
                long total = 0;
                for (int i = 0; i < counts.length; i++) {
                    total += counts[i] / guess;
                }
                return total >= k;
            }
        };

        public void solve(int testNumber, FastScanner in, PrintWriter out) {
            int n = in.nextInt();
            k = in.nextInt();

            counts = new int[1_000_000];
            for (int i = 0; i < n; i++) {
                counts[in.nextInt()]++;
            }


            long m = binsearch.maximizePredicateTrue(test, 1, 1_000_000);


            StringBuilder sb = new StringBuilder();
            int found = 0;
            outer:
            for (int i = 0; i < counts.length; i++) {
                while (counts[i] >= m) {
                    sb.append(i + " ");
                    counts[i] -= m;
                    found++;
                    if (found == k) {
                        break outer;
                    }
                }
            }


            out.println(sb.toString().trim());


        }

    }

    static class binsearch {
        public static long maximizePredicateTrue(LongPredicate tester, long low, long high) {
            assert (low >= 0);
            assert (high > 0);
            long mid = (high + low) / 2;
            int times = (int) ((((int) (Math.log(high) / Math.log(2))) + 1) * 1.1);

            //bin search on answer
            for (int t = 0; t < times; t++) {
                mid = (high + low) / 2;
                if (tester.success(mid)) {
                    //choose larger mid
                    low = mid;
                } else {
                    high = mid;
                }
            }

            long m = -1;

            for (long i = Long.min(mid + 3, high); i >= Long.max(mid - 3, low); i--) {
                if (tester.success(i)) {
                    m = i;
                    break;
                }
            }
            return m;
        }

    }

    static class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        public FastScanner(Reader in) {
            br = new BufferedReader(in);
        }

        public FastScanner(InputStream in) {
            this(new InputStreamReader(in));
        }

        public String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }

    static interface LongPredicate {
        boolean success(long guess);

    }
}