def BinSearchLeft(array, key):
    l = -1
    r = len(array)
    while l < r - 1:
        m = (l + r) // 2
        if array[m] < key:
            l = m
        else: r = m
    return r + 1

def BinSearchRight(array, key):
    l = -1
    r = len(array)
    while l < r - 1:
        m = (l + r) // 2
        if array[m] <= key:
            l = m
        else: r = m
    return r

with open('binsearch.out', 'w') as file:
    for element in request:
        if element in elements:
            print(BinSearchLeft(elements, element),BinSearchRight(elements,element), file=file)
        else: print(-1, -1, file=file)