Codeforces Round #653 (Div. 3) D - Zero Remainder Array

D. Zero Remainder Array
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
You are given an array
a
a
consisting of
n
n
positive integers.
Initially, you have an integer
x=0
x=0
. During one move, you can do one of the following two operations:
Choose exactly one
i
i
from
1
1
to
n
n
and increase
a
i
ai
by
x
x
(
a
i
:=
a
i
+x
ai:=ai+x
), then increase
x
x
by
1
1
(
x:=x+1
x:=x+1
).
Just increase
x
x
by
1
1
(
x:=x+1
x:=x+1
).
The first operation can be applied no more than once to each
i
i
from
1
1
to
n
n
.
Your task is to find the minimum number of moves required to obtain such an array that each its element is divisible by
k
k
(the value
k
k
is given).
You have to answer
t
t
independent test cases.
Input
The first line of the input contains one integer
t
t
(
1≤t≤2⋅
10
4
1≤t≤2⋅104
) — the number of test cases. Then
t
t
test cases follow.
The first line of the test case contains two integers
n
n
and
k
k
(
1≤n≤2⋅
10
5
;1≤k≤
10
9
1≤n≤2⋅105;1≤k≤109
) — the length of
a
a
and the required divisior. The second line of the test case contains
n
n
integers
a
1
,
a
2
,…,
a
n
a1,a2,…,an