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
from collections import defaultdict as dd
from collections import deque
import bisect
import heapq
import os
import sys
from io import BytesIO, IOBase

BUFSIZE = 8192

class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")


def ri():
    return int(input())

def rl():
    return list(map(int, input().split()))


def solve():
    n, sx, sy = rl()

    U = 0
    UR = 0
    R = 0
    DR = 0
    D = 0
    DL = 0
    L = 0
    UL = 0

    for i in range(n):
        x, y = rl()
        if x == sx and y > sy:
            U += 1
        elif x == sx and y < sy:
            D += 1
        elif x > sx and y == sy:
            R += 1
        elif x < sx and y == sy:
            L += 1
        elif x > sx and y > sy:
            U += 1
            R += 1
            UR += 1
        elif x > sx and y < sy:
            R += 1
            D += 1
            DR += 1
        elif x < sx and y < sy:
            D += 1
            L += 1
            DL += 1
        else:
            U += 1
            L += 1
            UL += 1

    m = max(U,L,D,R,UR,UL,DR,DL)
    print (m)
    if U == m:
        print (sx, sy + 1)
    elif UR == m:
        print (sx + 1, sy + 1)
    elif R == m:
        print (sx + 1, sy)
    elif DR == m:
        print (sx + 1, sy - 1)
    elif D == m:
        print (sx, sy - 1)
    elif DL == m:
        print (sx - 1, sy - 1)
    elif L == m:
        print (sx - 1, sy)
    elif UL == m:
        print (sx - 1, sy + 1)







mode = 's'

if mode == 'T':
    t = ri()
    for i in range(t):
        solve()
else:
    solve()
