import java.util.Scanner;
import java.util.*;
import java.util.stream.Collectors;
 
class Main {
    public static int min_num;
 
	public static void main(String[] args) {
        // 处理输入
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int m = in.nextInt();
        in.nextLine();
        List<Integer> woods =Arrays.stream(in.nextLine().split(" "))
                .map(Integer::parseInt)
                .collect(Collectors.toList());
 
        //先排序
        Collections.sort(woods);
 
        int result = 0;
        //遍历给的木料长度，每次都补一下最短的木板，每次补完之后重新排序，重复此步骤。
        for (int i = 0; i < m; i++) {
            woods.set(0,  woods.get(0) + 1);
            Collections.sort(woods);
            result = Math.max(result, woods.get(0));
        }
        System.out.println(result);
 
    }
 
}