M-arrays
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.
In the first test case we can divide the elements as follows:  $$$[4, 8]$$$. It is a $$$4$$$-divisible array because $$$4+8$$$ is divisible by $$$4$$$.  $$$[2, 6, 2]$$$. It is a $$$4$$$-divisible array because $$$2+6$$$ and $$$6+2$$$ are divisible by $$$4$$$.  $$$[9]$$$. It is a $$$4$$$-divisible array because it consists of one element. 
The first line contains a single integer $$$t$$$ $$$(1 \le t \le 1000)$$$  — the number of test cases.The first line of each test case contains two integers $$$n$$$, $$$m$$$ $$$(1 \le n \le 10^5, 1 \le m \le 10^5)$$$.The second line of each test case contains $$$n$$$ integers $$$a_1, a_2, \ldots, a_n$$$ $$$(1 \le a_i \le 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.
import sys
input = sys.stdin.readline

def readList():
    return list(map(int, input().split()))

def readInt():
    return int(input())

def readInts():
    return map(int, input().split())

def readStr():
    return input().strip()

def solve():
    (n, m) = readInts()
    arr = readList()
    if m == 1:
        return 1
    cnt = [0] * m
    for i in range(n):
        cnt[arr[i] % m] += 1
    ans = n - max(0, cnt[0] - 1)
    for i in range(1, m // 2):
        (mi, ma) = (cnt[i], cnt[m - i])
        ans -= max(2 * mi - 1, 0) if mi == ma else 2 * min(mi, ma)
    (mi, ma) = (cnt[m // 2], cnt[m - m // 2])
    if m % 2:
        ans -= max(2 * mi - 1, 0) if mi == ma else 2 * min(mi, ma)
    else:
        ans -= max(mi - 1, 0)
    return ans
for _ in range(int(input())):
    print(solve())
t = int(input())
for _ in range(t):
    (n, m) = map(int, input().split())
    a = [int(x) for x in input().split()]
    frq = [0] * m
    for i in range(n):
        frq[a[i] % m] += 1
    count = 0
    for i in range(m // 2 + 1):
        j = (m - i) % m
        if frq[i] + frq[j] > 0:
            val = max(abs(frq[i] - frq[j]), 1)
            count += val
    print(count)
t = int(input())
for _ in range(t):
    (n, m) = map(int, input().split())
    a = list(map(int, input().split()))
    d = {}
    for i in range(m):
        d[i] = 0
    for i in a:
        d[i % m] += 1
    ans = 0
    if d[0] != 0:
        ans += 1
    if m % 2 == 0:
        if d[m // 2] != 0:
            ans += 1
    for i in range(1, (m + 1) // 2):
        if d[i] != 0 or d[m - i] != 0:
            a = abs(d[i] - d[m - i])
            if a <= 1:
                ans += 1
            else:
                ans += a
    print(ans)