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