1 1000000000 7
1000000000 9
 3 2 2
2 4
2 1
3 6
 2 1000000000 100000
1000000000 1000000
1000000000 10000
 1 100 100
50 70
 1 100 100
101 100

1
1000000000 8 2
2 3 1
1000000000 100001 1
99 100 1
101 100
n, sx, sy = list(map(int, input().strip().split()))

students = []
for _ in range(n):
    x, y = list(map(int, input().strip().split()))
    students.append((x,y))

from collections import defaultdict

up = 0
down = 0
left = 0
right = 0
for x,y in students:
    if y > sy:
        up += 1
    if y < sy:
        down += 1
    if x < sx:
        left += 1
    if x > sx:
        right += 1

sez = [up, down, left, right]
maks = max((up, down, left, right))
index = sez.index(maks)
print(maks)
if index == 0:
    print(sx, sy+1)
elif index == 1:
    print(sx, sy-1)
elif index == 2:
    print(sx-1, sy)
else:
    print(sx+1, sy)

