def divisibleSumPairs(n, k, ar):
    ar_mod = [i%k for i in ar]
    count_mod = {}
    for i in ar_mod:
        if i not in count_mod:
            count_mod[i] = 0
        count_mod[i] += 1
    
    count = 0
    
    for i in ar_mod:
        count_mod[i] -= 1
        
        if i != 0:
            sub = k-i
        else:
            sub = 0
        
        if sub in count_mod:
            count += count_mod[sub]
    
    return count