CF1042A.Benches

There are $n$ benches in the Berland Central park. It is known that $a_i$ people are currently sitting on the $i$-th bench. Another $m$ people are coming to the park and each of them is going to have a seat on some bench out of $n$ available.

Let $k$ be the maximum number of people sitting on one bench after additional $m$ people came to the park. Calculate the minimum possible $k$ and the maximum possible $k$.

Nobody leaves the taken seat during the whole process.

伯兰中央公园里有 $n$ 条长椅。已知第 $i$ 条长椅上当前正坐着 $a_i$ 个人。另有 $m$ 个人将来到公园，他们每人将在现有的 $n$ 条长椅中选择一条坐下。

设 $k$ 为这额外的 $m$ 个人到来后，单条长椅上所坐人数的最大值。请计算 $k$ 的最小可能值和最大可能值。

在整个过程中，已就座的人不会离开其座位。

The first line contains a single integer $n$ $(1 \le n \le 100)$ — the number of benches in the park.

The second line contains a single integer $m$ $(1 \le m \le 10\,000)$ — the number of people additionally coming to the park.

Each of the next $n$ lines contains a single integer $a_i$ $(1 \le a_i \le 100)$ — the initial number of people on the $i$-th bench.

第一行包含一个整数 $n$（$1 \le n \le 100$）—— 公园中长椅的数量。

第二行包含一个整数 $m$（$1 \le m \le 10\,000$）—— 额外来到公园的人数。

接下来的 $n$ 行，每行包含一个整数 $a_i$（$1 \le a_i \le 100$）—— 第 $i$ 张长椅上初始的人数。

Print the minimum possible $k$ and the maximum possible $k$, where $k$ is the maximum number of people sitting on one bench after additional $m$ people came to the park.

输出最小可能的 $k$ 和最大可能的 $k$，其中 $k$ 表示额外 $m$ 人来到公园后，坐在同一张长椅上的人数的最大值。

In the first example, each of four benches is occupied by a single person. The minimum $k$ is $3$. For example, it is possible to achieve if two newcomers occupy the first bench, one occupies the second bench, one occupies the third bench, and two remaining — the fourth bench. The maximum $k$ is $7$. That requires all six new people to occupy the same bench.

The second example has its minimum $k$ equal to $15$ and maximum $k$ equal to $15$, as there is just a single bench in the park and all $10$ people will occupy it.

在第一个例子中，四张长椅每张各坐一人。最小的 $k$ 为 $3$。例如，可以这样实现：两名新来者坐在第一张长椅上，一名坐在第二张长椅上，一名坐在第三张长椅上，剩余两人坐在第四张长椅上。最大的 $k$ 为 $7$，这要求全部六名新来者都坐在同一张长椅上。

第二个例子中，由于公园里只有一张长椅，所有 $10$ 人将坐在该长椅上，因此其最小 $k$ 和最大 $k$ 均为 $15$。