Alice in the Digital World

After returning from Wonderland, Alice needs to improve her scientific skills in this digital world. Alice decides to take part in the ACM-ICPC Asia Nha Trang Regional Contest 2016 to evaluate her actual performance. Her favorite problem in the contest is the following.

Given an array of positive integers $A = a_1, a_2, \ldots, a_n$, a subarray $A_{i,j}$ of $A$ is a sequence of continuous elements in $A$, that is, $A_{i,j} = a_i, a_{i+1}, \ldots, a_j$ (where $1 \le i \le j \le n$). The weight of $A_{i,j}$ is the sum of all its elements.

Given an integer $m$, your task is to find the maximum weight subarray of $A$ that contains exactly one $m$ as the minimum element. You can assume that $A$ always contains at least one element with value $m$.

The input consists of several datasets. The first line of the input contains the number of datasets, which is a positive number and is not greater than 20. The following lines describe the datasets.

Each dataset is described by the following lines:

• The first line contains 2 positive integers $n$ and $m$ ($n \le 10^5$; $m \le 26$).
• The second line contains $n$ positive integers, each with value at most 26.

For each dataset, write out on one line the found maximum weight.