CF1042A Benches

``` ## 题目大意： 公园里有n把长椅，第i把长椅上坐着$a_i$个人，现在，会新来m个人，这m个人每人都会找一把长椅坐下。请求出来了m个人后人数最多的那把长椅上最多会有多少人？最少会有多少人？

第一行为1个整数n(1≤n≤100)，表示有n把长椅 第二行为1个m(1≤m≤10000)，表示会新来m个人 接下来n行，每行一个数$a_i$(1≤$ai$≤100) ，表示第i把长椅上最初有$a_i$个人

一行，两个数，分别表示来了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.