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.util.*;
import java.io.*;
import java.text.*;

public class Main {
    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in), 32768);
    static PrintWriter out = new PrintWriter(System.out);
    static StringTokenizer t;

    static String sn() {
        while (t == null || !t.hasMoreTokens()) {
            try {
                t = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                throw new RuntimeException();
            }
        }
        return t.nextToken();
    }

    static int ni() {
        return Integer.parseInt(sn());
    }

    static long nlo() {
        return Long.parseLong(sn());
    }

    public static void main(String args[]) {
        int t = 1;
        while (t-- > 0) {
            solve();
        }
        out.close();
    }

    static long mod = 998244353;

    static long pro(long a, long b) {
        return (a % mod * b % mod) % mod;
    }

    static long add(long a, long b) {
        return (a + b) % mod;
    }

    static int maxn = 200005;

    static int pow(int n) {
        return (int) (Math.log10(n) / Math.log10(2));
    }

    static long modpow(long x, long y) {
        long res = 1l;
        x %= mod;
        while (y > 0) {
            if (y % 2 != 0)
                res = pro(res, x);
            x = pro(x, x);
            y /= 2;
        }
        return res;
    }

    static class pair implements Comparable<pair> {
        int a;
        int b;

        pair(int x, int y) {
            a = x;
            b = y;
        }

        public int compareTo(pair o) {
            return (o.b - this.b);
        }
    }

    static void solve() {
        int n = ni();
        int k = ni();
        HashSet<Integer> a = new HashSet<>();
        int f[] = new int[maxn];
        for (int i = 0; i < n; i++) {
            int t = ni();
            a.add(t);
            f[t]++;
        }
        int l = a.size();
        pair arr[] = new pair[l];
        int p = 0;
        for (int h : a) {
            arr[p++] = new pair(h, f[h]);
        }
        Arrays.sort(arr);
        int low = 1, hi = n;
        int ans = 0;
        while (low <= hi) {
            int mid = (low + hi) / 2;
            if (count(arr, mid, k, l)) {
                ans = mid;
                low = mid + 1;
            } else
                hi = mid - 1;
        }
//        System.out.println(ans);
        List<Integer> res = new ArrayList<>();
        int i = 0;
        while (k > 0) {
            int d = arr[i].b / ans;
            if (d < k) {
                k -= d;
                while (d-- > 0)
                    res.add(arr[i].a);
            } else {
                while (k-- > 0) {
                    res.add(arr[i].a);
                }
            }
            i++;
        }
        for (int h : res)
            out.print(h + " ");
    }

    static boolean count(pair a[], int max, int k, int n) {
        long sum = 0;
        for (int i = 0; i < n; i++) {
            sum += a[i].b / max;
            if (sum >= k)
                return true;
        }
        return false;
    }
}