class Solution:
def missingElement(self, nums: List[int], k: int) -> int:
minn = nums[0]
left = 0
right = len(nums) - 1
while left < right:
mid = left + (right - left + 1) // 2
if nums[mid] >= minn + k + mid:
right = mid - 1
else:
left = mid
return minn + left + k