int divisibleSumPairs(int n, int k, vector<int> ar) {
    int count = 0;
    
    for (int i = 0; i < n; ++i)
    {
        for(int j = i; j < n; ++j)
        {   
            if(j != i)
            {
                if(IsDivisiblyByK(ar[i] + ar[j], k))
                {
                    count++;
                }
            }
        }
    }
    return count;
}