//----------vahagng----------//
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;
// template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
void print(long long t) { cerr << t; }
void print(int t) { cerr << t; }
void print(string t) { cerr << t; }
void print(char t) { cerr << t; }
void print(double t) { cerr << t; }
void print(long double t) { cerr << t; }
void print(unsigned long long t) { cerr << t; }
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[], V n) { cerr << "["; for (int i = 0; i < n; i++) { cerr << v[i] << " "; } cerr << "]"; }
template <class T, class V> void print(pair <T, V> p) { cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}"; }
template <class T> void print(vector <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T> void print(set <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T> void print(multiset <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T, class V> void print(map <T, V> v) { cerr << "[ "; for (auto i : v) { print(i); cerr << " "; } cerr << "]"; }
#define ll long long
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define ld long double
#define sz(v) v.size()
#define endl '\n'
const ll inf = 2e18, mod = 1e9 + 7, mod2 = 998244353;
void SetIO(string str = "") {
if (str != "") {
freopen((str + ".in").c_str(), "r", stdin);
freopen((str + ".out").c_str(), "w", stdout);
}
else {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
}
void FastIO() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
}
const int N = 2e5 + 10, M = 1e7 + 10;
const double eps = 1e-7;
mt19937 rnd(chrono::system_clock::now().time_since_epoch().count());
ll binpow(ll a, ll b, ll m) {
ll res = 1;
while (b) {
if (b & 1) {
res = (res * a) % m;
}
b >>= 1;
a = (a * a) % m;
}
return res;
}
ll n, k, a[N], b[N];
pair<int,int>par[2002][2002];
pair<ll,ll>dp[2002][2002], dp2[2002][2002][2];
class CMP{
public:
bool operator()(pair<ll,ll> A, pair<ll, ll> B){
if(A.first == B.first){
return A.second > B.second;
}
return A.first < B.first;
}
};
void solve(int tc) {
cin >> n >> k;
for(int i = 1; i <= n; i++){
cin >> a[i] >> b[i];
}
for(int i = 0; i <= n; i++){
for(int j = 0; j <= n; j++){
dp[i][j] = {inf, inf};
dp2[i][j][0] = dp2[i][j][1] = {inf, inf};
}
}
vector<int>ord(n + 1);
iota(all(ord), 0);
sort(all(ord), [](int i, int j){
if(b[i] == b[j]){
return a[i] < a[j];
}
return b[i] < b[j];
});
// dbg(ord);
int nax = 0;
dp[0][0] = {0, 0};
for(int i = 1; i <= n; i++){
for(int j = 0; j < i; j++){
dp[i][j] = dp[i-1][j];
par[i][j] = {i-1, j};
}
for(int j = 0; j < i; j++){
if(dp[i][j+1].first > dp[i-1][j].first + a[ord[i]] && b[ord[i]] > dp[i-1][j].second){
dp[i][j+1] = {dp[i-1][j].first + a[ord[i]], dp[i-1][j].second + 1};
par[i][j+1] = {i-1, j};
}
}
}
if(k >= 1 && n > 20){
for(int j = n; j >= 0; j--){
if(dp[n][j].first == inf) continue;
nax = j;
cout << j << ' ' << dp[n][j].first << endl;
break;
}
}
if(k > 2 && n <= 20){
priority_queue<pair<ll,ll>, vector<pair<ll,ll>>, CMP>pq;
for(int mask = 0; mask < (1 << n); mask++){
if(mask == 0){
pq.push({0, 0});
continue;
}
vector<int>id;
for(int i = 0; i < n; i++){
if(mask & (1 << i)){
id.push_back(i+1);
}
}
ll s = a[ord[id[0]]], pre = 1;
bool flag = 1;
for(int i = 1; i < id.size(); i++){
if(b[ord[id[i]]] > pre){
pre++;
s += a[ord[id[i]]];
}else{
flag = 0;
break;
}
}
if(flag) pq.push({id.size(), s});
}
while(k--){
cout << pq.top().first << ' ' << pq.top().second << endl;
pq.pop();
}
}else{
dp2[0][0][1] = {0, 0};
for(int i = 1; i <= n; i++){
for(int j = 0; j < i; j++){
dp2[i][j][1] = dp[i-1][j];
dp2[i][j][0] = dp2[i-1][j][0];
}
for(int j = 0; j < i; j++){
// i-1 hatum tarbervum a
if(dp2[i][j+1][0].first > dp2[i-1][j][0].first + a[ord[i]] && b[ord[i]] > dp2[i-1][j][0].second){
dp2[i][j+1][0] = {dp2[i-1][j][0].first + a[ord[i]], dp2[i-1][j][0].second + 1};
}
// i-1 hatum nmana
if(!(i-1 == par[i][j+1].first && j == par[i][j+1].second) && dp2[i][j+1][0].first > dp2[i-1][j][1].first + a[ord[i]] && b[ord[i]] > dp2[i-1][j][1].second){
dp2[i][j+1][0] = {dp2[i-1][j][1].first + a[ord[i]], dp2[i-1][j][1].second};
}
dp2[i][j+1][1] = dp[i][j+1];
}
}
for(int j = n; j >= 0; j--){
if(nax == j && dp2[n][j][0].first == inf) continue;
if(nax != j && dp2[n][j][0].first == inf && dp2[n][j][1].first == inf) continue;
cout << j << ' ' << (j == nax ? dp2[n][j][0].first : min(dp2[n][j][0].first, dp2[n][j][1].first)) << endl;
return;
}
}
}
void precalc() {
}
int main() {
// SetIO("teamwork");
FastIO();
int test_case = 1;
// cin >> test_case;
precalc();
int cnt = 1;
while (test_case--) {
solve(cnt++);
}
return 0;
}
