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 java.util.*;
import java.io.*;
public class C {
   public static void main(String[] args) {
      Scanner sc = new Scanner(System.in);
      
      int n = sc.nextInt();
      int sx = sc.nextInt();
      int sy = sc.nextInt();
      
      long[] ct = new long[4];
      for(int i = 0; i < n; i++) {
         int x = sc.nextInt();
         int y = sc.nextInt();
         
         if(x >= sx + 1) {
            ct[0]++;
         }
         if(y >= sy + 1) {
            ct[1]++;
         }
         if(x <= sx - 1) {
            ct[2]++;
         }
         if(y <= sy - 1) {
            ct[3]++;
         }
      }
      
      long max = 0;
      for(int i = 0; i < 4; i++) {
         max = Math.max(ct[i], max);
      }
      
      System.out.println(max);
      if(max == ct[0]) {
         System.out.println((sx + 1) + " " + sy);
      } else if(max == ct[1]) {
         System.out.println(sx + " " + (sy + 1));
      } else if(max == ct[2]) {
         System.out.println((sx - 1) + " " + sy);
      } else if(max == ct[3]) {
         System.out.println(sx + " " + (sy - 1));
      }
   }
}