#include <bits/stdc++.h>

using namespace std;

struct P {
    int x, y;
};
bool c(P a, P b) {
    return a.x < b.x;
}
int main() {
    long long n, a, b;
    cin >> n >> a >> b;
    vector<P> p(n);
    for (int i = 0; i < n; ++i) {
        cin >> p[i].x >> p[i].y;
    }
    sort(p.begin(), p.end(), c);
    long long n_A = n * a / (a + b);
    long long n_B = n - n_A;  // n_B = n * b / (a + b)
    long long x0 = p[n_A - 1].x; 
    long long y0 = p[n_A - 1].y;
    long long k = long(p[n_A].y - p[n_A - 1].y) * 1e12 / (p[n_A].x - p[n_A - 1].x);
    cout << k << " " << x0 << " " << y0 << endl;
    return 0;
}