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(self, nums, target):\n         """\n         :type nums: List[int]\n         :type target: int\n         :rtype: int\n         """\n         length = len(nums)\n         if length <= 0:\n             return -1\n         pivot = self.find_pivot(0, length-1, nums)\n         print(pivot)\n         search_index_A = self.binary_search(0, max(pivot-1, 0), nums, target)\n         search_index_B = self.binary_search(pivot, length-1, nums, target)\n         if search_index_A >= 0:\n             return search_index_A\n         elif search_index_B >= 0:\n             return search_index_B\n         else:\n             return -1\n     \n     def find_pivot(self, left_ind, right_ind, nums):\n         mid = left_ind + (right_ind - left_ind)//2\n         if left_ind == right_ind:\n             return left_ind\n         elif nums[mid] < nums[mid-1]:\n             return mid\n         elif nums[right_ind] < nums[mid]:\n             return self.find_pivot(mid+1, right_ind, nums)\n         else:\n             return self.find_pivot(left_ind, max(0,mid-1), nums)\n     \n     def binary_search(self, left_ind, right_ind, nums, target):\n         mid = left_ind + (right_ind - left_ind)//2\n         print(nums)\n         print(mid)\n         if nums[mid] == target:\n             return mid\n         elif left_ind == right_ind:\n             return -1\n         elif nums[mid] < target:\n             return self.binary_search(mid+1, right_ind, nums, target)\n         else:\n             return self.binary_search(left_ind, max(left_ind,mid-1), nums, target)\n \n # [5,1,3]\n # [0]\n \n # find_pivot(0,2,[5,1,3])\n # left = 0\n # right = 2\n # mid = 0 + 2//2 = 1\n # nums[mid] < nums[mid-1]\n # pivot = 1\n # binary_search(0, max(pivot-1,0), ...)\n # left = 0, right = 0\n # search_index_A = -1\n # binary_search(pivot, length-1, ...)\n # left = 1, right = 2\n # mid = 1 + (2-1)//2 = 1\n # binary_search(1, max(0,0), ...)\n # search_index_B = -1\n'
_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: 7250