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

inf = float("inf")
# sys.setrecursionlimit(10000000)

# abc='abcdefghijklmnopqrstuvwxyz'
# abd={'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}
mod, MOD = 1000000007, 998244353
# words = {1:'one',2:'two',3:'three',4:'four',5:'five',6:'six',7:'seven',8:'eight',9:'nine',10:'ten',11:'eleven',12:'twelve',13:'thirteen',14:'fourteen',15:'quarter',16:'sixteen',17:'seventeen',18:'eighteen',19:'nineteen',20:'twenty',21:'twenty one',22:'twenty two',23:'twenty three',24:'twenty four',25:'twenty five',26:'twenty six',27:'twenty seven',28:'twenty eight',29:'twenty nine',30:'half'}
# vow=['a','e','i','o','u']
# dx,dy=[0,1,0,-1],[1,0,-1,0]

# import random
# from collections import deque, Counter, OrderedDict,defaultdict
# from heapq import nsmallest, nlargest, heapify,heappop ,heappush, heapreplace
# from math import ceil,floor,log,sqrt,factorial,pi,gcd,degrees,atan2
# from bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right

def get_array(): return list(map(int, sys.stdin.readline().strip().split()))
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def input(): return sys.stdin.readline().strip()

# sys.stdin = open('input.txt', 'r')
# sys.stdout = open('output.txt', 'w')

n,schoolx,schooly = get_ints()
first = second = third = fourth = 0
gx = gy = sx = sy = 0
for i in range(n):
    x,y = get_ints()
    if x>schoolx and y>schooly:
        first+=1
    elif x>schoolx and y<schooly:
        fourth+=1
    elif x<schoolx and y>schooly:
        second+=1
    elif x<schoolx and y<schooly:
        third+=1
    elif x==schoolx:
        if y>schooly:
            gy+=1
        else:
            sy+=1
    elif y==schooly:
        if x>schoolx:
            gx+=1
        else:
            gy+=1
maxi = 0
# first+=max(gy,gx)
# second+=max(gy,sx)
# third+=max(sy,sx)
# fourth+=max(gx,sy)
ans1,ans2 = 0,0
if first+second+gy > maxi:
    maxi = first+gy+second
    ans1,ans2 = schoolx,schooly+1

if second+third+sx > maxi:
    maxi = second+third+sx
    ans1,ans2 = schoolx-1, schooly

if third+fourth+sy > maxi:
    maxi = third+fourth+sy
    ans1, ans2 = schoolx, schooly-1
if fourth+first+gx > maxi:
    maxi = fourth+first+gx
    ans1,ans2 = schoolx+1, schooly
print(maxi)
print(ans1, ans2)