#include <iostream>
#include <algorithm>
using namespace std;
struct dr
{
     long long nr1,nr2;
}y[100010];
long long rez1,rez2,x1,x2,k[100010],b[100010];
long long i,n;
bool cmp(dr nrr1,dr nrr2)
{
    if(nrr1.nr1<nrr2.nr1)
        return true;
    if(nrr1.nr1==nrr2.nr1&&nrr1.nr2<nrr2.nr2)
        return true;
    return false;
}
int main()
{
    cin>>n;
    cin>>x1>>x2;
    for(i=1;i<=n;i++)
    {
        cin>>k[i]>>b[i];
        y[i].nr1=k[i]*x1+b[i];
        y[i].nr2=k[i]*x2+b[i];
    }
    sort(y+1,y+n+1,cmp);
    /*for(i=1;i<=n;i++)
        cout<<y[i].nr1<<" "<<y[i].nr2<<'\n';*/
    for(i=1;i<n;i++)
        if(y[i].nr2>y[i+1].nr2&&(y[i].nr1!=y[i+1].nr1&&y[i].nr2!=y[i+1].nr2))
        {
            cout<<"YES";
            return 0;
        }
    cout<<"NO";
    return 0;
}