#include <iostream>
#include <algorithm>
using namespace std;

int Bossx, Bossy;

struct str {
	int x, y, dist;//kvadrat razdalje
}tocka[10005];

bool f(str a, str b) {
	if (a.dist != b.dist) return (a.dist < b.dist);
	if (a.x != b.x) return (a.x < b.x);
	return (a.y < b.y);
}

int main() {
	int N, K;
	cin >> N >> K;
	cin >> Bossx >> Bossy;
	for (int n = 0; n < N; n++) {
		cin >> tocka[n].x >> tocka[n].y;
		tocka[n].dist = (tocka[n].x - Bossx)*(tocka[n].x - Bossx)
			+ (tocka[n].y - Bossy)*(tocka[n].y - Bossy);
	}

	sort(tocka, tocka + N, f);

	for(int k=0; k<K; k++){
		cout << tocka[k].x << ' ' << tocka[k].y << '\n';
	}

	return 0;
}