Maximum Thrust Enhancement

You are given a spacecraft with n thrusters, where the i-th thruster produces a thrust value of \( t_i \). You are allowed to choose exactly one thruster and increase its thrust by \( k \) units. The task is to compute the maximum total thrust achievable after applying the adjustment.

The total thrust without any adjustment is given by \( T = \sum_{i=1}^{n} t_i \). Since you can only add \( k \) to one thruster, the maximum possible total thrust is:

[ T_{max} = \sum_{i=1}^{n} t_i + k ]

Please note that the input is provided via standard input and your program should print the result to standard output.

inputFormat

The input consists of two lines. The first line contains two integers \( n \) and \( k \) separated by a space, where \( n \) is the number of thrusters and \( k \) is the amount by which one thruster's thrust can be increased.

The second line contains \( n \) space-separated integers representing the current thrust values \( t_1, t_2, \dots, t_n \).

outputFormat

Output a single integer representing the maximum total thrust achievable after increasing one thruster's thrust by \( k \) units.

5 2
0 2 3 0 5

12