#include<iostream>
	#include<cstdio>
	#include<cstring>
	#include<map>
	#include<cmath>
	#include<queue>
	#include<algorithm>
	using namespace std;
	struct abab
	{
		int hao,cheng;
	}an[155000];
	long long cmp(struct abab a,struct abab b)
	{
		if(a.cheng==b.cheng)
		{
			return a.hao<b.hao;	
		}
		else
		{
			return a.cheng>b.cheng;
		}
	} 
	int main()
	{
	   int n,m,lin,fen,ans;
	   lin=m*1.5;
	   for(int i=0;i<=n;i++)
	   {
	     cin>>an[i].cheng>>an[i].hao;
	   }
	   fen=an[lin].cheng;
	   sort(an+1,an+n+1,cmp)
	   for(int i=1;i<=n;i++)
	   {
	     if(an[i].cheng>=fen)
		 {
		 	ans++;
		 	
		 }
		  if(an[i].cheng <fen)
		 {
		 	break;
			 }		
	   } 
	   cout<<ans<<" "<<fen<<endl;
	    for(int i=m;i<=n;i++)
	   {
	     if(an[i].cheng>=fen)
		 {
		 	cout<<an[i].cheng<<" "<<an[i].hao<<endl;
		 	
		 }
		
	   } 
	}