B'This is the easy version of the problem. The difference is the constraints on n , m and t . You can make hacks only if all versions of the problem are solved. Alice and Bob are given the numbers n , m and k , and play a game as follows: The game has a score that Alice tries to maximize, and Bob tries to minimize. The score is initially 0 . The game consists of n turns. Each turn, Alice picks a real number from 0 to k (inclusive) which Bob either adds to or subtracts from the score of the game. But throughout the game, Bob has to choose to add at least m out of the n turns. Bob gets to know which number Alice picked before deciding whether to add or subtract the number from the score, and Alice gets to know whether Bob added or subtracted the number for the previous turn before picking the number for the current turn (except on the first turn since there was no previous turn). If Alice and Bob play optimally, what will the final score of the game be? The first line of the input contains a single integer t ( 1 <= t <= 1000 ) -- the number of test cases. The description of test cases follows. Each test case consists of a single line containing the three integers, n , m , and k ( 1 <= m <= n <= 2000, 0 <= k < 10^9 + 7 ) -- the number of turns, how many of those turns Bob has to add, and the biggest number Alice can choose, respectively. It is guaranteed that the sum of n over all test cases does not exceed 2000 . For each test case output a single integer number -- the score of the optimal game modulo 10^9 + 7 . Formally, let M = 10^9 + 7 . It can be shown that the answer can be expressed as an irreducible fraction frac{p}{q} , where p and q are integers and q not equiv 0 pmod{M} . Output the integer equal to p cdot q^{-1} bmod M . In other words, output such an integer x that 0 <= x < M an'...