def divisibleSumPairs(n, k, ar): freq = [0] * k count = 0

for num in ar:
    mod = num % k
    complement = (k - num) % k
    count += freq[complement]
    freq[mod] += 1

return count