PROGRAMMING:Array of Keven
Keven thinks that the beauty value of an array is the maximum sum of some successive subarrays of the array (the subarray may be empty). For example, the beauty of array [10, - 5, 10, - 4, 1] is 15, and the beauty of array [- 3, - 5, - 1] is 0.
But gradually he felt bored, because he could always see the beauty value of this array at a glance. Recently ZWG gave him a number $$x $$, so Keven suddenly thought, if I multiply a continuous interval of this array by $$x $$, then what is the maximum beauty value I can get?
We define an operation to multiply a continuous interval of an array by $$x $. In this case, you are only allowed to use no more than one operation.
###Input format:
The first two numbers, $$n $$and $$x $$represent the length of the array and the value given by ZWG$$ 1<=n<=3*10^5$$ ，$$-100<=x<=100$$）
The second line, $$n $$digits, represents the value of the array$$- 10^9<=a_ i<=10^9$$）
###Output format:
Output the maximum beautiful value of no more than one operation in one line.
###Input sample
```in
5 -2
-3 8 -2 1 -6
```
```in
12 -3
1 3 3 7 1 3 3 7 1 3 3 7
```
```in
5 10
-1 -2 -3 -4 -5
```
###Output example:
```out
twenty-two
```
```out
forty-two
```
```out
0
```
###Tips:
In the first test case, we multiply the subarray [- 2,1, - 6] by $$x $$, and the array becomes [- 3,8,4, - 2,12], with a beauty level of 22 ([8,4, - 2,12]).
In the second test case, we didn't need to multiply any subarrays at all.
In the third test case, no matter which subarray we multiply, the beauty of the array is equal to 0. So the subinterval we take is empty.
answer：If there is no answer, please comment
But gradually he felt bored, because he could always see the beauty value of this array at a glance. Recently ZWG gave him a number $$x $$, so Keven suddenly thought, if I multiply a continuous interval of this array by $$x $$, then what is the maximum beauty value I can get?
We define an operation to multiply a continuous interval of an array by $$x $. In this case, you are only allowed to use no more than one operation.
###Input format:
The first two numbers, $$n $$and $$x $$represent the length of the array and the value given by ZWG$$ 1<=n<=3*10^5$$ ，$$-100<=x<=100$$）
The second line, $$n $$digits, represents the value of the array$$- 10^9<=a_ i<=10^9$$）
###Output format:
Output the maximum beautiful value of no more than one operation in one line.
###Input sample
```in
5 -2
-3 8 -2 1 -6
```
```in
12 -3
1 3 3 7 1 3 3 7 1 3 3 7
```
```in
5 10
-1 -2 -3 -4 -5
```
###Output example:
```out
twenty-two
```
```out
forty-two
```
```out
0
```
###Tips:
In the first test case, we multiply the subarray [- 2,1, - 6] by $$x $$, and the array becomes [- 3,8,4, - 2,12], with a beauty level of 22 ([8,4, - 2,12]).
In the second test case, we didn't need to multiply any subarrays at all.
In the third test case, no matter which subarray we multiply, the beauty of the array is equal to 0. So the subinterval we take is empty.
answer：If there is no answer, please comment