| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 2 초 | 2048 MB | 112 | 70 | 69 | 65.714% |
It is another cold and boring day on Farmer John's farm. To pass the time, Farmer John has invented a fun leisure activity involving performing operations on an integer array.
Farmer John has an array $a$ of $N$ (1ドル \leq N \leq 2 \cdot 10^5$) non-negative integers and an integer $M$ (1ドル \leq M \leq 10^9$). Then, FJ will ask Bessie for an integer $x$. In one operation, FJ can pick an index $i$ and subtract or add 1ドル$ to $a_i$. FJ's boredom value is the minimum number of operations he must perform so that $a_i-x$ is divisible by $M$ for all 1ドル \leq i \leq N$.
Among all possible $x,ドル output FJ's minimum possible boredom value.
The first line contains $T$ (1ドル \leq T \leq 10$), the number of independent test cases to solve.
The first line of each test case contains $N$ and $M$.
The second line of each test case contains $a_1, a_2, ..., a_N$ (0ドル \leq a_i \leq 10^9$).
It is guaranteed that the sum of $N$ over all test cases does not exceed 5ドル \cdot 10^5$.
For each test case, output an integer on a new line containing FJ's minimum possible boredom value among all possible values of $x$.
2 5 9 15 12 18 3 8 3 69 1 988244353 998244853
10 21
In the first test case, one optimal choice of $x$ is 3ドル$. FJ can perform 10ドル$ operations to make $a = [12, 12, 21, 3, 12]$.