You are given an array of integers, which may include both negative and positive values, and another integer S. Find three different integers in the array whose sum is closest to S. If multiple solutions exist, any is acceptable. Is there an algorithm to find the three integers in O(n^2) time?