#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
use std::io::{Write, BufWriter};
// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, [ $t:tt ]) => {{
        let len = read_value!($next, usize);
        (0..len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    }};

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

fn solve() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {
        ($($format:tt)*) => (write!(out,$($format)*).unwrap());
    }
    input! {
        n: usize, k: i64,
        a: [usize; n],
    }
    let mut occ = HashMap::new();
    for i in 0..n {
        occ.entry(a[i]).or_insert(vec![]).push(i);
    }
    const B: usize = 60;
    let mut dp = vec![vec![(0i64, 0); n]; B];
    for (_, indices) in occ {
        let k = indices.len();
        for i in 0..k {
            let x = indices[i];
            let y = indices[(i + 1) % k];
            dp[0][x] = (if i + 1 == k { 1 } else { 0 } + ((y + 1) / n) as i64,
                        (y + 1) % n);
        }
    }
    for i in 0..B - 1 {
        for j in 0..n {
            let (x, tmp) = dp[i][j];
            let (y, tmp) = dp[i][tmp];
            dp[i + 1][j] = (x + y, tmp);
        }
    }
    let mut x = 0;
    let mut y = 0;
    for i in (0..B).rev() {
        let (z, nxt) = dp[i][y];
        if x + z < k {
            x += z;
            y = nxt;
        }
    }
    // process elements one by one.
    assert_eq!(x, k - 1);
    let mut occ = HashSet::new();
    let mut v = vec![];
    for i in y..n {
        if !occ.contains(&a[i]) {
            v.push(a[i]);
            occ.insert(a[i]);
        } else {
            while let Some(x) = v.pop() {
                occ.remove(&x);
                if x == a[i] {
                    break;
                }
            }
        }
    }
    for a in v {
        puts!("{} ", a);
    }
    puts!("\n");
}

fn main() {
    // In order to avoid potential stack overflow, spawn a new thread.
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    thd.spawn(|| solve()).unwrap().join().unwrap();
}


Measured memory_bytes: 273956