class Solution:
  def threeSumClosest(self, nums: List[int], target: int) -> int:
    nums.sort()
    result = math.inf
    for i in range(len(nums)):
      j = i + 1
      k = len(nums) - 1
      while j < k:
        s = nums[i] + nums[j] + nums[k]
        if s == target:
          return s
        if s > target:
          k -= 1
        else:
          j += 1
        if abs(target-s) <= abs(target-result):
          result = s
    return result