Given a circular array C of integers represented by A, find the maximum possible sum of a non-empty subarray of C.
Here, a circular array means the end of the array connects to the beginning of the array.  (Formally, C[i] = A[i] when 0 <= i < A.length, and C[i+A.length] = C[i] when i >= 0.)
Also, a subarray may only include each element of the fixed buffer A at most once.  (Formally, for a subarray C[i], C[i+1], ..., C[j], there does not exist i <= k1, k2 <= j with k1 % A.length = k2 % A.length.)
 

Example 1:
Input: [1,-2,3,-2]
Output: 3
Explanation: Subarray [3] has maximum sum 3


Example 2:
Input: [5,-3,5]
Output: 10
Explanation: Subarray [5,5] has maximum sum 5 + 5 = 10


Example 3:
Input: [3,-1,2,-1]
Output: 4
Explanation: Subarray [2,-1,3] has maximum sum 2 + (-1) + 3 = 4


Example 4:
Input: [3,-2,2,-3]
Output: 3
Explanation: Subarray [3] and [3,-2,2] both have maximum sum 3

Example 5:
Input: [-2,-3,-1]
Output: -1
Explanation: Subarray [-1] has maximum sum -1

 
Note: 

-30000 <= A[i] <= 30000
1 <= A.length <= 30000

```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 maxSubarraySumCircular(self, A: List[int]) -> int:\n        # n = len(A)\n        # max_sub_ending = [A[0]]\n        # max_sub_start_index = [0]\n        \n#         A.extend(A)\n#         print(A)\n#         for i in range(1, len(A)):\n#             prev = max_sub_ending[i-1]\n#             if prev <= 0:\n#                 max_sub_start_index.append(i)\n#                 max_sub_ending.append(A[i])\n#             if i - max_sub_start_index[-1] < n:\n#                 max_sub_start_index.append(max_sub_start_index[-1])\n#                 max_sub_ending.append(A[i]+max_sub_ending[-1])\n#             elif (i - max_sub_start_index[-1]) == n:\n#                 index_len = len(max_sub_start_index)\n#                 val = max_sub_start_index[index_len-n]\n#                 current_sum = max_sub_ending[-1] - val\n#                 if current_sum <= 0:\n#                     max_sub_start_index.append(i)\n#                     max_sub_ending.append(A[i])\n#                 else:\n#                     max_sub_start_index.append(max_sub_start_index[-1]+1)\n#                     max_sub_ending.append(A[i]+current_sum)\n#         print(max_sub_ending)\n#         return max(max_sub_ending)\n        n = len(A)\n        max_sub_ending = [A[0]]\n        max_sub_ending_index = [0]\n        \n        for i in range(1, len(A)):\n            prev = max_sub_ending[i-1]\n            if prev <= 0:\n                max_sub_ending_index.append(i)\n                max_sub_ending.append(A[i])\n            else:\n                max_sub_ending_index.append(max_sub_ending_index[-1])\n                max_sub_ending.append(A[i]+max_sub_ending[-1])\n        print(max_sub_ending)\n        posmax = max(max_sub_ending)\n        total = sum(A)\n        \n        for i in range(len(A)):\n            A[i] = -A[i]\n        max_sub_ending = [A[0]]\n        max_sub_ending_index = [0]\n        \n        for i in range(1, len(A)):\n            prev = max_sub_ending[i-1]\n            if prev <= 0:\n                max_sub_ending_index.append(i)\n                max_sub_ending.append(A[i])\n            else:\n                max_sub_ending_index.append(max_sub_ending_index[-1])\n                max_sub_ending.append(A[i]+max_sub_ending[-1])\n        print(max_sub_ending)\n        negmax = max(max_sub_ending)+total   \n        if negmax > posmax and negmax != 0:\n            return negmax\n        else:\n            return posmax\n        \n#         cycle = max_sub_ending[-1]\n#         if cycle <= 0:\n#             return max(max_sub_ending)\n        \n#         for i in range(max_sub_ending_index[-1]):\n#             if cycle <= 0:\n#                 return max(max_sub_ending)\n            \n#             max_sub_ending_index[i] = cycle+A[i]\n#             cycle = max_sub_ending_index[i]\n#         return max(max_sub_ending)\n        \n#         total = sum(A)\n        \n#         #left sum\n#         left_sum = [A[0]]\n#         left = A[0]\n        \n#         for i in range(1, len(A)):\n            \n#             left = left+A[i]\n#             left_sum.append(left)\n        \n#         #right sum\n#         right = A[-1]\n#         right_sum = [right]\n        \n#         for i in range(len(A)-2, -1, -1):\n            \n#             right += A[i]\n#             right_sum.append(right)\n\n#         right_sum.reverse()\n        \n#         max_sub = total\n\n#         for i in range(0, len(A)):\n#             for j in range(i, len(A)):\n#                 left, right = 0, 0\n#                 if i != 0:\n#                     left = left_sum[i-1]\n#                 if j != (len(A) -1):\n#                     right = right_sum[j+1]\n#                 max_sub = max(max_sub, total - left - right , left+right)\n        \n#         #corner case\n#         if max(A) < 0:\n#             return max(A)\n#         return max_sub\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'maxSubarraySumCircular'
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: 6894