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
# import sys
# import collections
# MAX = 20
# sys.setrecursionlimit(10**6)


from sys import stdin, stdout


def inpu():
    return input().split(' ')


def inti(a):
    for i in range(len(a)):
        a[i] = int(a[i])
    return a


def inp():
    a = inpu()
    a = inti(a)
    return a


n, sx, sy = map(int, stdin.readline().split())
counts = {(1, 0): 0, (-1, 0): 0, (0, 1): 0, (0, -1): 0}
for _ in range(n):
    x, y = map(int, stdin.readline().split())
    if x > sx:
        counts[(1, 0)] += 1
    elif x < sx:
        counts[(-1, 0)] += 1
    if y > sy:
        counts[(0, 1)] += 1
    elif y < sy:
        counts[(0, -1)] += 1

maxcount, ans = 0, None
for d, v in counts.items():
    if v > maxcount:
        maxcount, ans = v, d

stdout.write("{}\n{} {}".format(maxcount, sx+ans[0], sy+ans[1]))
