#include <bits/stdc++.h>
#define int long long
using namespace std;

struct Node {
	int val;
	int idx;
};

bool c(Node& a, Node& b) {
	if (a.val == b.val)
		return a.idx < b.idx;
	return a.val >= b.val;
}

void merge(vector<Node>& v, int l, int mid, int r) {
	vector<Node> res(r - l + 1);
	int i = l, j = mid + 1, k = 0;
	for (; i <= mid && j <= r;)
		if (c(v[i], v[j]))
			res[k++] = v[i++];
		else
			res[k++] = v[j++];
	for (; i <= mid;)
		res[k++] = v[i++];
	for (; j <= r;)
		res[k++] = v[j++];
	for (i = l, k = 0; i <= r; i++, k++)
		v[i] = res[k];
}

void mergeSort(vector<Node>& v, int left, int right) {
	if (left >= right) return;
	int mid = left + (right - left) / 2;
	mergeSort(v, left, mid);
	mergeSort(v, mid + 1, right);
	merge(v, left, mid, right);
}

signed main() {
	int n, m; cin >> n >> m;
	m = m * 1.5;
	vector<Node> v(n + 1);
	double res = 0;
	for (int i = 1; i <= n; i++) {
		cin >> v[i].idx >> v[i].val;
	}
	mergeSort(v, 1, n);
	for (; m < n && v[m + 1].val == v[m].val; m++);
	cout << v[m].val << ' ' << m << endl;
	for (int i = 1; i <= m; i++)
		cout << v[i].idx << ' ' << v[i].val << endl;
	return 0;
}