Given two arrays nums1 and nums2.
Return the maximum dot product between non-empty subsequences of nums1 and nums2 with the same length.
A subsequence of a array is a new array which is formed from the original array by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (ie, [2,3,5] is a subsequence of [1,2,3,4,5] while [1,5,3] is not).
 
Example 1:
Input: nums1 = [2,1,-2,5], nums2 = [3,0,-6]
Output: 18
Explanation: Take subsequence [2,-2] from nums1 and subsequence [3,-6] from nums2.
Their dot product is (2*3 + (-2)*(-6)) = 18.
Example 2:
Input: nums1 = [3,-2], nums2 = [2,-6,7]
Output: 21
Explanation: Take subsequence [3] from nums1 and subsequence [7] from nums2.
Their dot product is (3*7) = 21.
Example 3:
Input: nums1 = [-1,-1], nums2 = [1,1]
Output: -1
Explanation: Take subsequence [-1] from nums1 and subsequence [1] from nums2.
Their dot product is -1.
 
Constraints:

1 <= nums1.length, nums2.length <= 500
-1000 <= nums1[i], nums2[i] <= 1000

```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 maxDotProduct(self, nums1: List[int], nums2: List[int]) -> int:\n        dp = []\n        maxes = []\n        for i in range(len(nums1)):\n            dp.append([])\n            maxes.append([])\n            for j in range(len(nums2)):\n                dp[i].append(0)\n                maxes[i].append(0)\n        for i in range(len(nums1)):\n            dp[i][0] = nums1[i] * nums2[0]\n            if i > 0:\n                dp[i][0] = max(dp[i][0], dp[i-1][0])\n        for j in range(len(nums2)):\n            dp[0][j] = nums1[0] * nums2[j]\n            if j > 0:\n                dp[0][j] = max(dp[0][j], dp[0][j-1])\n        for i in range(1, len(nums1)):\n            for j in range(1, len(nums2)):\n                dp[i][j] = max(dp[i-1][j-1] + nums1[i] * nums2[j],\n                               nums1[i] * nums2[j])\n                dp[i][j] = max(dp[i][j], dp[i-1][j])\n                dp[i][j] = max(dp[i][j-1], dp[i][j])\n        return dp[-1][-1]\n#         dp = []\n#         maxes = []\n#         for i in range(len(nums1)):\n#             dp.append([])\n#             maxes.append([])\n#             for j in range(len(nums2)):\n#                 dp[i].append(0)\n#                 maxes[i].append(0)\n        \n#         for i in range(len(nums1)):\n#             dp[i][0] = nums1[i] * nums2[0]\n#             maxes[i][0] = nums1[i] * nums2[0]\n#             if i > 0:\n#                 maxes[i][0] = max(maxes[i-1][0], nums1[i] * nums2[0])\n#         for j in range(len(nums2)):\n#             dp[0][j] = nums1[0] * nums2[j]\n#             maxes[0][j] = nums1[0] * nums2[j]\n#             if j > 0:\n#                 maxes[0][j] = max(maxes[0][j-1], nums1[0] * nums2[j])\n                \n#         for i in range(1, len(nums1)):\n#             for j in range(1, len(nums2)):\n#                 dp[i][j] = max(maxes[i-1][j-1] + nums1[i] * nums2[j],\n#                               nums1[i] * nums2[j])\n#                 maxes[i][j] = max(maxes[i-1][j-1], maxes[i-1][j])\n#                 maxes[i][j] = max(maxes[i][j], maxes[i][j-1])\n#                 maxes[i][j] = max(maxes[i][j], dp[i][j])\n        \n#         return maxes[i][j]\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'maxDotProduct'
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: 7130