#include <bits/stdc++.h>
using namespace std;
struct zuobiao{
	int a1,a2;
}shu[6000];
bool cmp(zuobiao a,zuobiao b)
{
	if(a.a2 == b.a2)return a.a1 < b.a1;
	else return a.a2 > b.a2;
}
int main(){
    int a,b,m,zhi,zhi2,c,d;
	cin>>a>>b;
	m=floor(b*1.5);
	for(int i=0;i<a;i++){
		cin>>shu[i].a1>>shu[i].a2;
	}	
	sort(shu,shu+a,cmp);
	cout<<shu[m-1].a2<<" ";
	zhi=shu[m-1].a2;	
	zhi2=m;
	for(int i=m;i<a;i++){
		if(shu[i].a2==zhi)zhi2++;
	}
	cout<<zhi2<<endl;
	for(int i=0;i<zhi2;i++){
		cout<<shu[i].a1<<" "<<shu[i].a2<<endl;
	}
	 
}

#include<bits/stdc++.h>
using namespace std;
int m,n,i,j,k=1,t,u,ans;
struct peanuts{
    int x,y,time,w;
};  peanuts p[1000001];
int a[1010][1010];
int main(){
    cin>>m>>n>>t;
    for(i=1;i<=m;i++)
       for(j=1;j<=n;j++){
          cin>>a[i][j];
             if(a[i][j]>0) {
             p[k].w=a[i][j];
             p[k].x=i;
             p[k].y=j;
             k++;
         }
      }
    for(i=1;i<k;i++)
       for(j=i+1;j<=k;j++)
          if(p[i].w<p[j].w)  swap(p[i],p[j]);
     for(i=1;i<=k;i++){
         u=p[i].x;
            if(i==1) p[i].time=p[i].x+1; 
              else   p[i].time=p[i-1].time+abs(p[i].x-p[i-1].x)+abs(p[i].y-p[i-1].y)+1;
                 if (p[i].time+u<=t) ans+=p[i].w;
     }
    cout<<ans;
    return 0;
}