Number of Divisible Triplet Sums

Count how many index triplets (i < j < k) in an integer array have a sum divisible by a given divisor K; the core challenge is to use modular arithmetic and frequency/combinatorics (or efficient pairing) to avoid brute-force O(n^3) enumeration.