class Solution:
def searchInsert(self, nums: List[int], target: int) -> int:
small = 0
big = len(nums)-1
while small <= big :
mid = (big + small) // 2
if nums[mid] == target :
return mid
elif nums[mid] > target :
big = mid - 1
else :
small = mid + 1
return small