#include<bits/stdc++.h>
using namespace std;
int n,k[5005],s[5005],x[5005],ans=0,q=0,k1[5005];
int main()
{
	int m;
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	{
		cin>>k[i]>>s[i];
		x[i]=s[i];
	}	
	sort(s+1,s+n+1);
	m=m*150/100;
	q=s[m];
	for(int i=n;i>=1;i--)
	{
		while(s[i]>=q)
		{
			ans++;	
			for(int j=1;j<=n;j++)
			{
				if(s[i]==x[j])
				{	
					k1[i]=k[j];
				}
			}		
			
		}
	}
	cout<<s[ans]<<" "<<ans;
	for(int i=ans;i>=1;i--)
	{
		cout<<k1[i]<<" "<<s[i];
	}
	return 0;
}