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
#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long int t = 1;
  while (t--) {
    long long int n;
    cin >> n;
    long long int x, y;
    cin >> x >> y;
    vector<pair<long long int, long long int>> vec;
    for (long long int i = 0; i < n; i++) {
      long long int a, b;
      cin >> a >> b;
      vec.push_back(make_pair(a, b));
    }
    sort(vec.begin(), vec.end());
    long long int i;
    for (i = 0; i < n;) {
      if (vec[i].first <= x)
        i++;
      else
        break;
    }
    long long int left = i;
    long long int right = n - left;
    if (left <= right) {
      cout << right << "\n";
      cout << x + 1 << " " << y << "\n";
    } else {
      cout << left << "\n";
      cout << x - 1 << " " << y << "\n";
    }
  }
  return 0;
}
