pub mod scanner {

    pub struct Scanner {
        buf: Vec<String>,
    }

    impl Scanner {
        pub fn new() -> Self {
            Self { buf: vec![] }
        }

        pub fn new_from(source: &str) -> Self {
            let source = String::from(source);
            let buf = Self::split(source);
            Self { buf }
        }

        pub fn next<T: std::str::FromStr>(&mut self) -> T {
            loop {
                if let Some(x) = self.buf.pop() {
                    return x.parse().ok().expect("");
                }
                let mut source = String::new();
                std::io::stdin().read_line(&mut source).expect("");
                self.buf = Self::split(source);
            }
        }

        fn split(source: String) -> Vec<String> {
            source
                .split_whitespace()
                .rev()
                .map(String::from)
                .collect::<Vec<_>>()
        }
    }
}

use std::collections::{BTreeMap, BinaryHeap};

use crate::scanner::Scanner;

fn main() {
    let mut scanner = Scanner::new();
    let t: usize = 1;
    for _ in 0..t {
        solve(&mut scanner);
    }
}

fn solve(scanner: &mut Scanner) {
    let n: usize = scanner.next();
    let k: usize = scanner.next();
    let mut count = BTreeMap::new();
    for _ in 0..n {
        let a: usize = scanner.next();
        *count.entry(a).or_insert(0) += 1;
    }
    let mut que = BinaryHeap::new();
    for (_, &v) in count.iter() {
        que.push(v);
    }
    let mut ans: usize = 0;
    let mut now: usize = 0;
    while let Some(v) = que.pop() {
        ans += 1;
        now += v;
        if now >= k {
            println!("{}", ans);
            return;
        }
    }
}