CF1011B.Planning The Expedition

Natasha is planning an expedition to Mars for $n$ people. One of the important tasks is to provide food for each participant.

The warehouse has $m$ daily food packages. Each package has some food type $a_i$.

Each participant must eat exactly one food package each day. Due to extreme loads, each participant must eat the same food type throughout the expedition. Different participants may eat different (or the same) types of food.

Formally, for each participant $j$ Natasha should select his food type $b_j$ and each day $j$-th participant will eat one food package of type $b_j$. The values $b_j$ for different participants may be different.

What is the maximum possible number of days the expedition can last, following the requirements above?

娜塔莎正在为 $n$ 人策划一次火星远征任务。其中一项重要任务是为每位参与者提供食物。

仓库中有 $m$ 份每日食物包，每份食物包具有某种食物类型 $a_i$。

每位参与者每天必须恰好食用一份食物包。由于极端负荷，每位参与者在整个远征期间必须始终食用同一种食物类型。不同参与者可以食用不同（或相同）类型的食物。

形式化地说，对于每位参与者 $j$，娜塔莎应为其选定食物类型 $b_j$，此后第 $j$ 位参与者每天将食用一份类型为 $b_j$ 的食物包。不同参与者对应的 $b_j$ 值可以不同。

在满足上述要求的前提下，此次远征最多能持续多少天？

The first line contains two integers $n$ and $m$ ($1 \le n \le 100$, $1 \le m \le 100$) — the number of the expedition participants and the number of the daily food packages available.

The second line contains sequence of integers $a_1, a_2, \dots, a_m$ ($1 \le a_i \le 100$), where $a_i$ is the type of $i$-th food package.

第一行包含两个整数 $n$ 和 $m$（$1 \le n \le 100$，$1 \le m \le 100$）—— 分别表示远征队成员人数和每日可用的食物包数量。

第二行包含一个整数序列 $a_1, a_2, \dots, a_m$（$1 \le a_i \le 100$），其中 $a_i$ 表示第 $i$ 个食物包的类型。

Print the single integer — the number of days the expedition can last. If it is not possible to plan the expedition for even one day, print 0.

输出一个整数——远征可以持续的天数。如果甚至无法规划为期一天的远征，则输出 0。

In the first example, Natasha can assign type $1$ food to the first participant, the same type $1$ to the second, type $5$ to the third and type $2$ to the fourth. In this case, the expedition can last for $2$ days, since each participant can get two food packages of his food type (there will be used $4$ packages of type $1$, two packages of type $2$ and two packages of type $5$).

In the second example, there are $100$ participants and only $1$ food package. In this case, the expedition can't last even $1$ day.

在第一个例子中，娜塔莎可以将第 1 类食物分配给第一位参与者，同样将第 1 类食物分配给第二位参与者，将第 5 类食物分配给第三位参与者，将第 2 类食物分配给第四位参与者。此时，远征活动可持续 $2$ 天，因为每位参与者均可获得两份其对应类型的食物（共消耗 $4$ 份第 1 类食物、$2$ 份第 2 类食物以及 $2$ 份第 5 类食物）。

在第二个例子中，共有 $100$ 名参与者，但仅有 $1$ 份食物。此时，远征活动甚至无法持续 $1$ 天。