import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;

/**
 * @author mahiru
 * @version v1.0.0
 * @className P1068
 * @description P1068 [NOIP2009 普及组] 分数线划定
 * @date 2024/12/05 14:48
 **/
public class P1068 {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);

        int n = in.nextInt();
        int m = in.nextInt();
        in.nextLine();

        int[][] arr = new int[n][2];

        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < 2; ++j) {
                arr[i][j] = in.nextInt();
            }
            in.nextLine();
        }

        Arrays.sort(arr, (a, b) -> {
                    if (a[1] == b[1]) {
                        return Integer.compare(a[1], b[0]);
                    } else {
                        return Integer.compare(b[1], a[1]);
                    }
                }
        );

        int passNum = (int) (m * 1.5);
        int passScore = arr[passNum][1];

        int overNum = 0;
        for (int i = passNum; i < n; ++i) {
            if (arr[i][1] == passScore) {
                overNum += 1;
            } else {
                break;
            }
        }

        System.out.print(passScore + " " + (passNum + overNum));
        System.out.println();
        for (int i = 0; i < passNum + overNum; ++i) {
            System.out.print(arr[i][0] + " " + arr[i][1]);
            System.out.println();
        }
    }
}