Problem:
Score : 700 points

Problem Statement

We have a sequence of N \times K integers: X=(X_0,X_1,\cdots,X_{N \times K-1}).
Its elements are represented by another sequence of N integers: A=(A_0,A_1,\cdots,A_{N-1}). For each pair i, j (0 \leq i \leq K-1,\ 0 \leq j \leq N-1), X_{i \times N + j}=A_j holds.

Snuke has an integer sequence s, which is initially empty.
For each i=0,1,2,\cdots,N \times K-1, in this order, he will perform the following operation:

If s does not contain X_i: add X_i to the end of s.

If s does contain X_i: repeatedly delete the element at the end of s until s no longer contains X_i. Note that, in this case, we do not add X_i to the end of s.

Find the elements of s after Snuke finished the operations.

Constraints

1 \leq N \leq 2 \times 10^5

1 \leq K \leq 10^{12}

1 \leq A_i \leq 2 \times 10^5

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N K
A_0 A_1 \cdots A_{N-1}

Output

Print the elements of s after Snuke finished the operations, in order from beginning to end, with spaces in between.

Sample Input 1

3 2
1 2 3

Sample Output 1

2 3

In this case, X=(1,2,3,1,2,3).
We will perform the operations as follows:

i=0: s does not contain 1, so we add 1 to the end of s, resulting in s=(1).

i=1: s does not contain 2, so we add 2 to the end of s, resulting in s=(1,2).

i=2: s does not contain 3, so we add 3 to the end of s, resulting in s=(1,2,3).

i=3: s does contain 1, so we repeatedly delete the element at the end of s as long as s contains 1, which causes the following changes to s: (1,2,3)→(1,2)→(1)→().

i=4: s does not contain 2, so we add 2 to the end of s, resulting in s=(2).

i=5: s does not contain 3, so we add 3 to the end of s, resulting in s=(2,3).

Sample Input 2

5 10
1 2 3 2 3

Sample Output 2

3

Sample Input 3

6 1000000000000
1 1 2 2 3 3

Sample Output 3

s may be empty in the end.

Sample Input 4

11 97
3 1 4 1 5 9 2 6 5 3 5

Sample Output 4

9 2 6

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Time Limit Exceeded)

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Scanner;
import java.util.LinkedHashMap;
import java.util.ArrayList;
import java.util.HashMap;

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

    static class BDoNotDuplicate {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            long k = in.nextLong();
            int arr[] = new int[n];
            for (int i = 0; i < n; i++) arr[i] = in.nextInt();
            ArrayList<Integer> list = new ArrayList<>();
            HashMap<Integer, ArrayList<Integer>> map = new HashMap<Integer, ArrayList<Integer>>();
            Integer val = 1;
            while (k > 0) {

                for (int i = 0; i < n; i++) {
                    if (!list.contains(arr[i])) {
                        list.add(arr[i]);
                    } else {
                        int index = list.indexOf(arr[i]);
                        ArrayList<Integer> list1 = new ArrayList<>();
                        //list1.addAll(index,list);
                        for (int j = list.size() - 1; j >= index; j--) list1.add(list.get(j));
                        //out.println("list1: "+list1);
                        list.removeAll(list1);
                        //out.println("list: "+list);
                    }
                }
                //out.println("list outside: "+list);
                //out.println("value of val before increment: "+val);
                //out.println(map);
                map.put(val, new ArrayList<>(list));
                //out.println(map.get(val));
                //out.println(map);
                val++;
                //out.println("value of val after increment: "+val);
                k--;
                if (list.size() == 0) break;
            }
            //out.println("map size:"+map.size());
            //out.println(map);
            for (Map.Entry<Integer, ArrayList<Integer>> entry : map.entrySet()) {
                //out.println("key value: "+entry.getKey()+" "+"value of key: "+map.get(val));
                if ((k - entry.getKey()) % map.size() == 0) {
                    ArrayList<Integer> list1 = entry.getValue();
                   // out.println("list1 in if: "+list1+" "+"key value in if : "+entry.getKey());
                    for (int i = 0; i < list1.size(); i++) out.print(list1.get(i) + " ");
                    break;
                }
            }
        }

    }
}