#include <bits/stdc++.h> using namespace std; struct node{ int id; int score; }stu; bool cmp(node A,node B){ if(A.score!=B.score) return A.score>B.score; return A.id<B.id; } int main() { node a[5005]; int n,m,m1,score1; cin>>n>>m; for(int i=0;i<n;i++){ cin>>a[i].id>>a[i].score; } m1=ceil(m*1.5); sort(a,a+n,cmp); cout<<a[m1-1].score<<" "<<m1<<endl; for(int i=0;i<m1;i++){ cout<<a[m-1].id<<" "<<a[i].score<<endl; } }