n, m = map(int, input().split())
a = list(map(int, input().split()))
counts = [0 for i in range(n)]
for i in range(n):
counts[i] = a.count(i+1)
print(min(counts))#include <bits/stdc++.h>
using namespace std;
int freq[1000+1];
int main()
{
int n,k;cin>>n>>k;
int a[k];
for(int i=0;i<k;i++)
{
cin>>a[i];
freq[a[i]-1]++;
}
sort(freq,freq+n);
cout<<freq[0];
}
1334B - Middle Class | 260C - Balls and Boxes |
1554A - Cherry | 11B - Jumping Jack |
716A - Crazy Computer | 644A - Parliament of Berland |
1657C - Bracket Sequence Deletion | 1657B - XY Sequence |
1009A - Game Shopping | 1657A - Integer Moves |
230B - T-primes | 630A - Again Twenty Five |
1234D - Distinct Characters Queries | 1183A - Nearest Interesting Number |
1009E - Intercity Travelling | 1637B - MEX and Array |
224A - Parallelepiped | 964A - Splits |
1615A - Closing The Gap | 4C - Registration System |
1321A - Contest for Robots | 1451A - Subtract or Divide |
1B - Spreadsheet | 1177A - Digits Sequence (Easy Edition) |
1579A - Casimir's String Solitaire | 287B - Pipeline |
510A - Fox And Snake | 1520B - Ordinary Numbers |
1624A - Plus One on the Subset | 350A - TL |