def divisibleSumPairs(n, k, ar):
    count = 0
    for index, i in enumerate(ar):
        for j in ar[index+1:]:
            if (i + j) % k == 0:
                count+=1        
    return count