26565번 - Time Limits 다국어

문제

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

입력

The first line of input will contain a single integer m that indicates the number datasets to follow. Each dataset is comprised of two lines. The first line of input contains two space-separated integers n and s (1 ≤ n ≤ 100 and 1 ≤ s ≤ 20). The second line of input contains n space-separated integers t₁, . . . , t_n (1 ≤ tk ≤ 2000 for all k = 1, . . . , n).

출력

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

제한

힌트