#include <bits/stdc++.h>
//#define DEBUG 1106
#define int long long
#define ll long long
#define ld long double
#define pb emplace_back
#define p_q priority_queue
#define m_p make_pair
#define pii pair<int,int>
#define endl '\n'
#define INIT ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define FOR(i,a,b) for (int i = a; i <= b; i++)
#define forn(i,n) for (int i = 0; i < n; i++)
#define forn1(i,n) for (int i = 1; i <= n; i++)
#define all(x) x.begin(),x.end()
#define ft first
#define sd second
#define lowbit(x) (x&(-x))
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
#ifdef DEBUG
#define debug(x) cout << #x << ": " << x << endl;
#else
#define debug(x) 1106;
#endif
using namespace std;
const int N = 2005;
const int M = 2005;
const int inf = 1e9;
const int INF = 1e18;
const int MOD = 1e9+7;
pii a[N];
bool cmp(pii x, pii y) {
if(x.ft!=y.ft) return x.ft > y.ft;
return x.sd < y.sd;
}
signed main() {
INIT
#ifdef DEBUG
freopen("input.txt", "r", stdin);
#endif
///////////
int n, k;
cin >> n >> k;
forn(i,n) {
cin >> a[i].sd >> a[i].ft;
}
sort(a,a+n);
//forn(i,n) cout << a[i] << ' '; cout << endl;
vector<pii> ret;
forn(i,(1<<n)) {
bool flag = 1;
int x = 0, y = 0; // n, cost
forn(j,n) {
if(i&(1<<j)) {
x++;
y+=a[j].sd;
if(x>a[j].ft) {
flag=0;
break;
}
}
}
if(flag) ret.pb(m_p(x,y));
}
sort(all(ret),cmp);
forn(i,k) {
cout << ret[i].ft << ' ' << ret[i].sd;
cout << endl;
}
}
