n, m = map(int, input().split())
alist = [[]] * n
for i in range(n):
    alist[i] = list(map(int, input().split()))
def mao_pao(alist):
    num = len(alist)
    for j in range(num - 1):
        count = 0
        for i in range(num - 1 - j):
            if alist[i][1] < alist[i + 1][1]:
                alist[i], alist[i + 1] = alist[i + 1], alist[i]
                count += 1
        if count == 0:
            return
mao_pao(alist)
m = int(1.5 * m)
time = 0
for i in range(m-1, n):
    if alist[i][1] == alist[m - 1][1]:
        time += 1
m = m + time - 1
alist = alist[:m + 1]
for i in range(m - 1):
    if alist[i][1] == alist[i + 1][1]:
        if alist[i][0] > alist[i][1]:
            alist[i][0], alist[i + 1][0] = alist[i + 1][0], alist[i][0]
print(alist[m - 1][1], end=' ')
print(m)
for i in range(m):
    print(alist[i][0], end=' ')
    print(alist[i][1])