如何在嵌套列表中执行二进制搜索？

def binary_search_nested_list(nested_list, target):
    low = 0
    high = len(nested_list) - 1

    while low <= high:
        mid = (low + high) // 2
        sublist = nested_list[mid]

        if target < sublist[0] or target > sublist[-1]:
            # 目标值不在当前子列表中
            if target < sublist[0]:
                high = mid - 1
            else:
                low = mid + 1
        else:
            # 在当前子列表中应用二进制搜索
            sublist_result = binary_search(sublist, target)
            if sublist_result is not None:
                return sublist_result
            else:
                # 目标值不在当前子列表中
                if target < sublist[0]:
                    high = mid - 1
                else:
                    low = mid + 1

    return None

def binary_search(sorted_list, target):
    low = 0
    high = len(sorted_list) - 1

    while low <= high:
        mid = (low + high) // 2
        if sorted_list[mid] == target:
            return mid
        elif sorted_list[mid] < target:
            low = mid + 1
        else:
            high = mid - 1

    return None