Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.

(i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).

You are given a target value to search. If found in the array return its index, otherwise return -1.

You may assume no duplicate exists in the array.

Your algorithm's runtime complexity must be in the order of O(log n).

Example 1:


Input: nums = [4,5,6,7,0,1,2], target = 0
Output: 4


Example 2:


Input: nums = [4,5,6,7,0,1,2], target = 3
Output: -1

```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 search_interval(self, start, end, nums, target):\n         if start == end:\n             if nums[start] == target:\n                 return start\n             else:\n                 return -1\n \n         size = end - start\n         half = size // 2\n         new_start_1 = start\n         new_end_1 = start + half\n         new_start_2 = start + half + 1\n         new_end_2 = end\n \n         # check first interval\n         first_half_sorted = False\n         first_half_contains = False\n         second_half_sorted = False\n         second_half_contains = False\n         if nums[new_end_1] >= nums[new_start_1]:\n             first_half_sorted = True\n             if (target >= nums[new_start_1]) and (target <= nums[new_end_1]):\n                 first_half_contains = True\n         if nums[new_end_2] >= nums[new_start_2]:\n             second_half_sorted = True\n             if (target >= nums[new_start_2]) and (target <= nums[new_end_2]):\n                 second_half_contains = True\n             \n         if first_half_contains:\n             return self.search_interval(new_start_1, new_end_1, nums, target)\n         elif second_half_contains:\n             return self.search_interval(new_start_2, new_end_2, nums, target)\n         elif first_half_sorted:\n             return self.search_interval(new_start_2, new_end_2, nums, target)\n         elif second_half_sorted:\n             return self.search_interval(new_start_1, new_end_1, nums, target)\n \n     def search(self, nums, target):\n         """\n         :type nums: List[int]\n         :type target: int\n         :rtype: int\n         """\n         \n         if len(nums) == 0:\n             return -1\n \n         return self.search_interval(0, len(nums) - 1, nums, target)'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'search'
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: 6488