#include<bits/stdc++.h>
using namespace std;
#define int long long
int n,p,q;
struct node{
    int x,y,val;
}a[1000005];
bool cmp(node a,node b){
    return a.val<b.val;
}int gcd(int x,int y){
    if(x == 0 or y == 0)return x|y;
    return gcd(y,x%y);
}
signed main(){
    cin>>n>>p>>q;
    for(int i = 1;i<=n;i++){
        cin>>a[i].x>>a[i].y;
        a[i].val = q*a[i].y-p*a[i].x;
    }sort(a+1,a+1+n,cmp);
    long double ans = -2000000005,aim = 1.0*p/q;int p1 =0,p2 =0;
    for(int i = 1;i<n;i++){
        if(a[i].x == a[i+1].x)continue;
        long double k = (1.0*a[i+1].y-a[i].y)/(1.0*a[i+1].x-a[i].x);
        if(abs(aim-ans)>abs(aim-k)){
            ans = k;p1 = i,p2 = i+1;
        }
    }//cout<<ans<<' '<<aim<<' ' <<p1<<' '<<p2<<endl;
    int aa = a[p1].y-a[p2].y,bb = a[p1].x-a[p2].x;
    //cout<< aa<<' '<<bb<<endl;
    int g = gcd(aa,bb);aa/=g,bb/=g;
    cout<<aa<< '/'<<bb<<endl;
    return 0;
}