Given an array and a value Sum, we need to print any three indices i, j, k such that i != j and j != k and arr[i] + arr[j] + arr[k] = Sum. Can we do it in better than N^2, something like NlogN?