function divisibleSumPairs(n, k, ar) {
    let totalPairs = 0;
    for (let iteration = 0; iteration < n; iteration++) {
        ar.forEach((element, index) => {
        if (index <= iteration) return;
        if ((ar[iteration] + element) % k === 0) totalPairs++;
        });
    }
    console.info(totalPairs)
    return totalPairs;

}