#include <bits/stdc++.h>
using namespace std;
int a[102] = {0};
int main() {
  int n, m, i, ans = 0, x, l, r, num, mid;
  cin >> n >> m;
  for (i = 0; i < m; i++) {
    cin >> x;
    a[x]++;
  }
  sort(a + 1, a + 101);
  l = 1;
  r = 10000;
  while (l <= r) {
    num = 0;
    mid = (l + r) >> 1;
    for (i = 100; i > 0; i--) {
      if (a[i] < mid) break;
      num += a[i] / mid;
    }
    if (num >= n) {
      ans = mid;
      l = mid + 1;
    } else
      r = mid - 1;
  }
  cout << ans << endl;
  return 0;
}
