B"You are given an array a_1, a_2, ldots, a_n consisting of n positive integers and a positive integer m . You should divide elements of this array into some arrays. You can order the elements in the new arrays as you want. Let's call an array m -divisible if for each two adjacent numbers in the array (two numbers on the positions i and i+1 are called adjacent for each i ) their sum is divisible by m . An array of one element is m -divisible. Find the smallest number of m -divisible arrays that a_1, a_2, ldots, a_n is possible to divide into. The first line contains a single integer t (1 <= t <= 1000) -- the number of test cases. The first line of each test case contains two integers n , m (1 <= n <= 10^5, 1 <= m <= 10^5) . The second line of each test case contains n integers a_1, a_2, ldots, a_n (1 <= a_i <= 10^9) . It is guaranteed that the sum of n and the sum of m over all test cases do not exceed 10^5 . For each test case print the answer to the problem. In the first test case we can divide the elements as follows: "...