#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
int main() {
  int N,K; cin >> N >> K;
  map<int,int> dic;
  for(int i = 0; i < N; i++) {
    int a; cin >> a;
    dic[a]++;
  }
  map<int,int> ans;
  for (const auto& [key, value] : dic) {
    ans[value]++;
  }
  int x = -1;
  for (const auto& [key, value] : ans) {
    x = max(value,x);
    
  }
  cout << min(x,K) << endl;
}