Task E

def right_bin_search(x, a):
    l, r = 0, len(a)
    while r - l > 1:
        m = (l + r) // 2
        if x >= a[m]:
            l = m
        else:
            r = m
    if x == a[l]:
        return l


def left_bin_search(x, a):
    l, r = -1, len(a) - 1
    while r - l > 1:
        m = (l + r) // 2
        if x <= a[m]:
            r = m
        else:
            l = m
    if x == a[r]:
        return r


n, k = map(int, input().split())
nums1 = [int(i) for i in input().split()]
nums2 = [int(i) for i in input().split()]
for i in nums2:
    try:
        print(left_bin_search(i, nums1) + 1, right_bin_search(i, nums1) + 1)
    except:
        print(0)