#include<fstream>
#include<algorithm>
using namespace std;
struct vector {int g,p;}c[8001];

using namespace std;

int sortare(vector x,vector y) { return (x.g<y.g); }

 
int main()
{int n,gr,i;
ifstream in("rucsac.in"); 
ofstream out("rucsac.out");
in>>n>>gr;
for(i=1;i<=n;i++)
	in>>c[i].g>>c[i].p;
sort(c+1,c+n+1,sortare);
i=1;
int s=0,maxim=0;

while(s+c[i].g<gr)
{maxim=maxim+c[i].p;
 s=s+c[i].g;
i++;}
for(i=1;i<=n;i++)
	out<<c[i].g<<" "<<c[i].p<<'\n';
	out<<maxim;

in.close();
out.close();
return 0;
}