Time Limits

A contest setter wants to set the time limit for a problem. There are $n$ model solutions, and model solution $k$ takes $t_k$ milliseconds to run on the test data. The time limit must be an integer number of seconds and must be at least $s$ times the running time of the slowest model solution. Compute the minimum time limit the setter can choose.

The first line contains a single integer $m$, the number of datasets. Each dataset has two lines. The first line contains two space-separated integers $n$ and $s$ ($1 \le n \le 100$, $1 \le s \le 20$). The second line contains $n$ space-separated integers $t_1, \ldots, t_n$ ($1 \le t_k \le 2000$ for all $k = 1, \ldots, n$).

For each dataset, print on one line the minimum time limit in seconds as a single integer.