Return the length of the shortest, non-empty, contiguous subarray of A with sum at least K.
If there is no non-empty subarray with sum at least K, return -1.
 



Example 1:
Input: A = [1], K = 1
Output: 1


Example 2:
Input: A = [1,2], K = 4
Output: -1


Example 3:
Input: A = [2,-1,2], K = 3
Output: 3

 
Note:

1 <= A.length <= 50000
-10 ^ 5 <= A[i] <= 10 ^ 5
1 <= K <= 10 ^ 9

```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 shortestSubarray(self, A: List[int], K: int) -> int:\n        running = [0]\n        for num in A: \n            running.append(running[-1] + num)\n            \n        result = math.inf\n        deque = collections.deque([0]) # left idx\n        r = 1 \n        \n        while r < len(running): \n            if not deque: \n                deque.append(r)\n                r += 1 \n                continue \n                \n            while deque and r < len(running) and running[r] - running[deque[0]] < K:\n                        \n                #pop the last of the queue if it is smaller to maintain mono increasing queue \n                while deque and running[r] <= running[deque[-1]]: \n                    deque.pop()\n                    \n                deque.append(r)\n                r += 1 \n            \n            # right reached the end yet still not satisfied \n            if r == len(running): \n                break\n                \n            while deque and running[r] - running[deque[0]] >= K:\n                l = deque.popleft()\n                result = min(result, r-l)   \n    \n            # r += 1\n            \n        return result if result != math.inf else -1\n            \n\n\n        '''\n        \n                    #pop the last of the queue if it is smaller to maintain mono increasing queue \n                while deque and running[r] <= running[deque[-1]]: \n                    deque.pop()\n                    \n                    \n        l = 0\n        r = 1 \n        \n        while r < len(running): \n            \n            while r < len(running) and running[r] - running[l] < K: \n                r += 1 \n            while l < r and running[r] - running[l+1] >= K: \n                l += 1\n            result = min(result, r-l)\n            r += 1\n            l  += 1\n            \n        return result\n            \n        \n            while r < len(running): \n            while deque and running[r] - running[deque[0]] >= K:\n                result = min(result, i-deque[0])\n                deque.popleft()\n            while deque and running[r] <= running[deque[-1]]:\n                deque.pop()\n            deque.append(r)\n            \n        return result if result != math.inf else -1\n    \n    \n                \n            while r < len(running)-1 and running[r] - running[l] < s: \n                r += 1 \n\n            while l < r and running[r] - running[l] >= s:\n                result = min(result, r-l)                \n                l += 1\n                \n            r += 1\n        '''\n"
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'shortestSubarray'
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: 6844