def binary_search(array, x):
    left = 0
    right = len(array) - 1

    while left < right:
        mid = left + (right - left)/2
        if array[mid] > x:
            right = mid
        else:
            left = mid + 1

    return left

def counts(nums, maxes):
    res = []
    nums = sorted(nums)
    for value in maxes:
        if value >= nums[-1]:
            res.append(len(nums))
        else:
            tmp = binary_search(nums, value)
            res.append(tmp)

    return res