You are given a sorted integer array, nums, and an integer, target. The array may have been rotated by an arbitrary number. Your task is to find and return the index of target in this array. If target does not exist, return -1.

An original sorted array before rotation is given below:

After rotating this array 6 times, it changes to:

Constraints

• All values in nums are unique.
• The values in nums are sorted in ascending order.
• The array may have been rotated by some arbitrary number.
• $1 \leq$ nums.length $\leq 1000$
• $-10^4 \leq$ nums[i] $\leq 10^4$
• $-10^4 \leq$ target $\leq 10^4$