/*------------------------------------------------------------------*/
/*------------------------- begin template -------------------------*/
/*------------------------------------------------------------------*/

// ref: tanakh <https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8>
// diff: using Parser
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut parser = Parser::from_str($s);
        input_inner!{parser, $($r)*}
    };
    (parser = $parser:ident, $($r:tt)*) => {
        input_inner!{$parser, $($r)*}
    };
    (new_stdin_parser = $parser:ident, $($r:tt)*) => {
        let stdin = std::io::stdin();
        let reader = std::io::BufReader::new(stdin.lock());
        let mut $parser = Parser::new(reader);
        input_inner!{$parser, $($r)*}
    };
    ($($r:tt)*) => {
        input!{new_stdin_parser = parser, $($r)*}
    };
}

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

macro_rules! read_value {
    ($parser:ident, ( $($t:tt),* )) => {
        ( $(read_value!($parser, $t)),* )
    };
    ($parser:ident, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($parser, $t)).collect::<Vec<_>>()
    };
    ($parser:ident, chars) => {
        read_value!($parser, String).chars().collect::<Vec<char>>()
    };
    ($parser:ident, char_) => {
        read_value!($parser, String).chars().collect::<Vec<char>>()[0]
    };
    ($parser:ident, usize1) => {
        read_value!($parser, usize) - 1
    };
    ($parser:ident, i64_) => {
        $parser.fast_i64()
    };
    ($parser:ident, usize_) => {
        $parser.fast_i64() as usize
    };
    ($parser:ident, usize1_) => {
        ($parser.fast_i64() - 1) as usize
    };
    ($parser:ident, $t:ty) => {
        $parser.next::<$t>().expect("Parse error")
    };
}

use std::io;
use std::io::BufRead;
use std::str;

// ref: tatsuya6502 <https://qiita.com/tatsuya6502/items/cd448486f7ef7b5b8c7e>
// ref: wariuni <https://qiita.com/tatsuya6502/items/cd448486f7ef7b5b8c7e#comment-7040a5ae96305e884eb9>
// diff: using std::io::BufRead::fill_buf()
pub struct Parser<R> {
    pub reader: R,
    buf: Vec<u8>,
    pos: usize,
}

impl Parser<io::Empty> {
    pub fn from_str(s: &str) -> Parser<io::Empty> {
        Parser {
            reader: io::empty(),
            buf: s.as_bytes().to_vec(),
            pos: 0,
        }
    }
}

impl<R: BufRead> Parser<R> {
    pub fn new(reader: R) -> Parser<R> {
        Parser {
            reader: reader,
            buf: vec![],
            pos: 0,
        }
    }
    pub fn update_buf(&mut self) {
        self.buf.clear();
        self.pos = 0;
        loop {
            let (len, complete) = {
                let buf2 = self.reader.fill_buf().unwrap();
                self.buf.extend_from_slice(buf2);
                let len = buf2.len();
                (len, buf2[len - 1] <= 0x20)
            };
            self.reader.consume(len);
            if complete {
                break;
            }
        }
    }
    pub fn next<T: str::FromStr>(&mut self) -> Result<T, T::Err> {
        loop {
            let mut begin = self.pos;
            while begin < self.buf.len() && (self.buf[begin] <= 0x20) {
                begin += 1;
            }
            let mut end = begin;
            while end < self.buf.len() && (self.buf[end] > 0x20) {
                end += 1;
            }
            if begin != self.buf.len() {
                self.pos = end;
                return unsafe { str::from_utf8_unchecked(&self.buf[begin..end]) }.parse::<T>();
            } else {
                self.update_buf();
            }
        }
    }
    pub fn fast_i64(&mut self) -> i64 {
        loop {
            let mut begin = self.pos;
            while begin < self.buf.len() && (self.buf[begin] <= 0x20) {
                begin += 1;
            }
            if begin == self.buf.len() {
                self.update_buf();
                continue;
            }
            let mut res = 0;
            let (is_positive, mut end) = match self.buf[begin] {
                b'+' => (true, begin + 1),
                b'-' => (false, begin + 1),
                _ => (true, begin),
            };
            while end < self.buf.len() && (self.buf[end] > 0x20) {
                res = res * 10 + (self.buf[end] as i64 - '0' as i64);
                end += 1;
            }
            if begin != self.buf.len() {
                self.pos = end;
                return if is_positive { res } else { -res };
            } else {
                self.update_buf();
            }
        }
    }
}

#[allow(unused_imports)]
use std::cmp::*;
use std::fmt::Display;
use std::fmt::Write;

pub fn writeln_vec<T: Display>(s: &mut String, xs: &Vec<T>) {
    if xs.len() == 0 {
        writeln!(s, "");
    } else {
        write!(s, "{}", xs[0]);
        for x in xs.iter().skip(1) {
            write!(s, " {}", x);
        }
        writeln!(s, "");
    }
}

fn main() {
    input! {
        new_stdin_parser = parser,
    }
    let res = solve(&mut parser);
    print!("{}", res);
}

/*------------------------------------------------------------------*/
/*-------------------------- end template --------------------------*/
/*------------------------------------------------------------------*/

fn solve<R: BufRead>(parser: &mut Parser<R>) -> String {
    let mut buf = String::new();
    input! {
        parser = parser,
        n: usize,
        m: usize,
        xs: [usize1; n],
    }
    if n == 1 {
        if m % 2 == 0 {
        } else {
            writeln!(buf, "{}", xs[0] + 1);
        }
        return buf;
    }
    let mut prev = vec![0; 2_00000];
    let mut next = vec![0; n];
    for i in (0..2 * n).rev() {
        if i < n {
            next[i] = prev[xs[i % n]] % n;
        }
        prev[xs[i % n]] = i;
    }
    // eprintln!("next = {:?}", next);
    let seq = {
        let mut res = vec![];
        let mut p = 0;
        res.push(p);
        p = (next[p] + 1) % n;
        while p != 0 {
            res.push(p);
            p = (next[p] + 1) % n;
        }
        res
    };
    // eprintln!("seq = {:?}", seq);
    let mut r = 0;
    for i in 1..seq.len() {
        if seq[i - 1] + 1 % n == seq[i] || seq[i - 1] > seq[i] {
            r += 1;
        }
        if i == seq.len() - 1 && seq[i] == n - 1 {
            r += 1;
        }
    }
    r += 1;
    let mut ps = vec![0; r];
    // eprintln!("r = {:?}", r);
    if m % r == 0 {
        return buf;
    }
    r = 0;
    for i in 1..seq.len() {
        if seq[i - 1] + 1 == seq[i] || seq[i - 1] > seq[i] {
            r += 1;
            ps[r] = seq[i];
        }
        if i == seq.len() - 1 && seq[i] == n - 1 {
            r += 1;
        }
    }
    r += 1;
    // eprintln!("ps = {:?}", ps);
    let begin = if *seq.last().unwrap() != n - 1 {
        ps[(m + r - 1) % r]
    } else {
        ps[(m + r - 1) % r]
        // return buf;
    };
    // eprintln!("begin.. = {:?}", &xs[begin..]);
    // (v,pos)
    let mut res = vec![];
    // x -> vec![i];
    let mut x_to_is = vec![vec![]; 2_00000];
    for (i, &x) in xs[begin..n].iter().enumerate() {
        let i = i + begin;
        // eprintln!("i = {}", i);
        if x_to_is[x].is_empty() {
            res.push((x, i));
            x_to_is[x].push(i);
        } else {
            let prev_i = x_to_is[x][x_to_is[x].len() - 1];
            loop {
                if res.last().unwrap().1 > prev_i {
                    x_to_is[res.last().unwrap().0].pop();
                    res.pop();
                } else {
                    break;
                }
            }
            res.pop();
            x_to_is[x].pop();
        }
    }
    let res: Vec<usize> = res.iter().map(|&(x, _)| x + 1).collect();
    if res.len() != 0 {
        writeln_vec(&mut buf, &res);
    }
    buf
}


Measured memory_bytes: 33020