分数线划定

#include <bits/stdc++.h>
using namespace std;
#define js ios::sync_with_stdio(false);cin.tie(0); cout.tie(0)
typedef long long ll; typedef unsigned long long ull; typedef long double ld;
const ll MOD = 1e9 + 7;
inline ll read() { ll s = 0, w = 1; char ch = getchar(); while (ch < 48 || ch > 57) { if (ch == '-') w = -1; ch = getchar(); }    while (ch >= 48 && ch <= 57) s = (s << 1) + (s << 3) + (ch ^ 48), ch = getchar();    return s * w; }
inline void write(ll x) { if (!x) { putchar('0'); return; } char F[40]; ll tmp = x > 0 ? x : -x; if (x < 0)putchar('-');    int cnt = 0;    while (tmp > 0) { F[cnt++] = tmp % 10 + '0';        tmp /= 10; }    while (cnt > 0)putchar(F[--cnt]); }
inline ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll qpow(ll a, ll b) { ll ans = 1;    while (b) { if (b & 1)    ans *= a;        b >>= 1;        a *= a; }    return ans; }    ll qpow(ll a, ll b, ll mod) { ll ans = 1; while (b) { if (b & 1)(ans *= a) %= mod; b >>= 1; (a *= a) %= mod; }return ans % mod; }
inline int lowbit(int x) { return x & (-x); }

const int N = 1e6 + 7;
int  b[N];
stack<int> st;

struct node{
    int nn;
    int s;
}a[10000];

int cmpp(node x, node y){
    if(x.s == y.s) return x.nn < y.nn;
    return x.s > y.s;
}
int main(){
    int n,m;
    cin>>n>>m;
    for(int i=0;i<n;i++){
        cin>>a[i].nn>>a[i].s;
    }
    sort(a,a+n,cmpp);
    int ans = m * 1.5;
    //cout<<ans<<endl;
    int res = a[ans-1].s;
    //cout<<res<<endl;
    int tot = 0;
    
    for(int i=0;i<n;i++){
        if(a[i].s >= res) tot++;
    }
    cout<<res<<" "<<tot<<endl;
    
    for(int i=0;i<n;i++){
        if(a[i].s >=res){
            cout<<a[i].nn<<" "<<a[i].s<<endl;
        }
    }
    return 0;
}