def smallest_missing(A, left_element, right_element):
    left = left_element
    right = right_element
    
    while left <= right:
        mid = (left + right) // 2
        if A[mid] == mid:
            left = mid + 1
        else:
            right = mid - 1
    
    return left