#include<iostream>
#include<stdio.h>
#include<math.h>
#include<algorithm>
using namespace std;

struct stu
{
    int id, f;
} a[5005];

bool cmp(stu a, stu b)
{
    if (a.f != b.f) return a.f > b.f;
    return a.id < b.id;
}

int main()
{
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i].id >> a[i].f;
    }
    int lf = floor(m * 150 / 100);
    sort(a + 1, a + n + 1, cmp);
    int cnt = n - lf;
    for (int i = lf; i <= n; i++)
    {
        if (a[lf].f == a[i].f)
        {
            ++cnt;
        }
        else
        {
            break;
        }
    }
    cout << a[lf].f << " " << cnt << endl;
    for (int i = 1; i <= cnt; i++)
    {
        cout << a[i].id << " " << a[i].f << endl;
    }
    return 0;
}