#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef __int128 i128;
typedef double db;
ll gcd(ll x, ll y){
    if(!y) return x;
    return gcd(y, x%y);
}
set<int> ch[310];
deque<int> ab[310];
int n;
ll r, s;
double suma, sumb;
double dlt(ll dx, ll dy){
    return dx+1.00*r*s/(sumb+dy)-1.00*r*s/sumb;
}
void del(){
    while(true){
        int id = -1;
        double now = 0;
        for(int i = 1; i <= 300; i++){
            if(ch[i].empty()) continue;
            int dy = *ch[i].begin();
            if(dlt(-i, -dy) < now) id = i, now = dlt(-i, -dy);
        }
        if(id == -1) break;
        int dy = *ch[id].begin(); ch[id].erase(ch[id].begin());
        suma -= id, sumb -= dy;
    }
}
int main(){
    scanf("%d%lld%lld", &n, &r, &s);
    for(int i = 1; i <= n; i++){
        int a, b; scanf("%d%d", &a, &b);
        ab[a].push_back(b);
    }
    for(int i = 1; i <= 300; i++) sort(ab[i].begin(), ab[i].end(), greater<int> ());
    int cnt = 0;
    while(cnt < n){
        for(int i = 1; i <= 300; i++){
            if(ab[i].empty()) continue;
            int y = ab[i][0]; ab[i].pop_front();
            if(!cnt|| dlt(i, y) < 0){
                suma += i, sumb += y;
                ch[i].insert(y);
                del();
            }
            cnt++;
        }
    }
    ll A = suma*sumb+r*s, B = sumb;
    ll g = gcd(A, B);
    printf("%lld %lld\n", A/g, B/g);
    return 0;
}
/*
3 11 3
1 3
2 7
5 13
*/