#include <bits/stdc++.h>   using namespace std;   int nums[105];   int main() {     int n, m, mayor;     cin >> n >> m;     for (int i = 0; i < n; i++) {       cin >> nums[i];     }     sort(nums, nums + n);     reverse(nums, nums + n);     int maximo = nums[0] + m;     mayor = nums[0];     for (int i = 0; i < n; i++) {       m -= mayor - nums[i];       nums[0] = mayor;     }     int i = 0;     while (m > 0) {       m--;       nums[i % n]++;       i++;     }     int minimo = nums[0];     cout << minimo <<     << maximo <<   n ;   }   