B"You are given an array a_1, a_2, ... , a_n , consisting of n integers. You are also given an integer value x . Let f(k) be the maximum sum of a contiguous subarray of a after applying the following operation: add x to the elements on exactly k distinct positions. An empty subarray should also be considered, it has sum 0 . Note that the subarray doesn't have to include all of the increased elements. Calculate the maximum value of f(k) for all k from 0 to n independently. The first line contains a single integer t ( 1 <= t <= 5000 ) -- the number of testcases. The first line of the testcase contains two integers n and x ( 1 <= n <= 5000 ; 0 <= x <= 10^5 ) -- the number of elements in the array and the value to add. The second line contains n integers a_1, a_2, ... , a_n ( -10^5 <= a_i <= 10^5 ). The sum of n over all testcases doesn't exceed 5000 . For each testcase, print n + 1 integers -- the maximum value of f(k) for all k from 0 to n independently. In the first testcase, it doesn't matter which elements you add x to. The subarray with the maximum sum will always be the entire array. If you increase k elements by x , k cdot x will be added to the sum. In the second testcase: "...