Given an array `nums` and a `target`, find three integers whose sum is closest to target and return that sum. If two sums are equally close, return the smaller sum. Exactly one answer is produced by this rule.