Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integers. You may assume that each input would have exactly one solution.

Example:


Given array nums = [-1, 2, 1, -4], and target = 1.

The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

def _disabled_input(*args, **kwargs):
    raise RuntimeError("input() is disabled in callable mode")
builtins.input = _disabled_input

ns = {"__name__": "__judge__"}  # prevent if __name__ == "__main__" blocks
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'class Solution:\n     def threeSumClosest(self, nums, target):\n         """\n         :type nums: List[int]\n         :type target: int\n         :rtype: int\n         """\n         \'\'\'\n         nums = sorted(nums)\n         size = len(nums)\n         res = list()\n         for i in range(size-2):\n             if i and nums[i] == nums[i-1]:\n                 continue\n             left, right = i+1, size-1\n             while left < right:\n                 sums = nums[i] + nums[left] + nums[right]\n                 if sums == target:\n                     return target\n                 else:\n                     res.append(sums)\n                     if sums < target:\n                         while left < right and nums[left] == nums[left+1]:\n                             left += 1\n                         left += 1\n                     else:\n                         while left < right and nums[right] == nums[right-1]:\n                             right -= 1\n                         right -= 1\n         return self.helper(res, target)\n     \n     def helper(self, nums, target):\n         if not nums:\n             return\n         goal = abs(nums[0] - target)\n         res = nums[0]\n         for num in nums[1:]:\n             if abs(num-target) < goal:\n                 goal = abs(num-target)\n                 res = num\n         return res\n \n         \'\'\'        \n         nums = sorted(nums)\n         size = len(nums)\n         res = None\n         diff = None\n         for i in range(size-2):\n             if i and nums[i] == nums[i-1]:\n                 continue\n             left, right = i+1, size-1\n             if not diff:\n                 res = nums[i] + nums[left] + nums[right]\n                 diff = abs(res-target)\n             while left < right:\n                 sums = nums[i] + nums[left] + nums[right]\n                 if sums == target:\n                     return target\n                 elif sums < target:\n                     partial = nums[i] + nums[right]\n                     while left < right and nums[left] == nums[left+1]:\n                         left += 1\n                     while left < right and partial+nums[left] < target:\n                         left += 1\n                     tmp = partial + nums[left-1]\n                     if abs(tmp-target) < diff:\n                         res, diff = tmp, abs(tmp-target)\n                 else:\n                     partial = nums[i] + nums[left]\n                     while left < right and nums[right] == nums[right-1]:\n                         right -= 1\n                     while left < right and partial+nums[right] > target:\n                         right -= 1\n                     tmp = partial + nums[right+1]\n                     if abs(tmp-target) < diff:\n                         res, diff = tmp, abs(tmp-target)\n         return res\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'threeSumClosest'
if _fn_name:
    if "Solution" in ns:
        try:
            _obj = ns["Solution"]()
            if hasattr(_obj, _fn_name):
                _target = getattr(_obj, _fn_name)
        except Exception:
            _target = None
    if _target is None and _fn_name in ns and callable(ns[_fn_name]):
        _target = ns[_fn_name]
# Fallback: if there's exactly one user-defined function, use it
if _target is None:
    _cands = [v for k, v in ns.items() if callable(v) and getattr(v, "__module__", "") in ("__judge__", "__main__")]
    _user_funcs = [c for c in _cands if getattr(c, "__name__", "").startswith("_") is False]
    if len(_user_funcs) == 1:
        _target = _user_funcs[0]
if _target is None:
    raise RuntimeError(f"Could not resolve callable '{_fn_name}'")

_raw = sys.stdin.read().strip()
if _raw:
    _parsed = json.loads(_raw)
    if isinstance(_parsed, dict):
        _kwargs = _parsed.get("kwargs", {})
        _args = _parsed.get("args", [])
    else:
        _args, _kwargs = _parsed, {}
else:
    _args, _kwargs = [], {}
if not isinstance(_args, (list, tuple)):
    _args = [_args]
_res = _target(*_args, **_kwargs)
try:
    sys.stdout.write(repr(_res) + "\n")
except Exception:
    pass

```

Measured memory_bytes: 6372