//Saptak_Roy_Turja
#include<bits/stdc++.h>
#define ll long long int
#define d double
using namespace std;
int main()
{
    ll n,x,y;
    cin>>n>>x>>y;
    d ans=0.0;
    while(n--){
        d a,b;
        cin>>a>>b;
        d c=(y-b)/(x-a);
        ans=max(ans,y-x*c);
    }
    printf("%0.20lf\n",ans);
}

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(i,a,b) for(ll i=a;i<b;i++)
#define loop1(i,a,b) for(ll i=a;i<=b;i++)
#define rloop(i,b,a) for(ll i=b;i>=a;i--)
#define test() int t;cin>>t;while(t-->0) 
#define speed ios_base::sync_with_stdio(false);   cin.tie(NULL);   cout.tie(NULL);
#define endl "\n" 
#define mp make_pair
#define pb push_back
#define mod 1000000007
//const ld PI  = 3.141592653589793;

bool isPrime(int n) 
{ 
    // Corner cases 
    if(n<=3){
        return true;
    }
    if (n % 2 == 0 || n % 3 == 0) 
        return false; 
  
    for (int i = 5; i * i <= n; i = i + 6) 
        if (n % i == 0 || n % (i + 2) == 0) 
            return false; 
  
    return true; 
}




int main()
{
   speed
    double x,y,z;
    cin>>x>>y>>z;
    double cost=y/x;
    double tt=z*cost;
    int t=tt;
    if((double)t<tt){
        cout<<t;
    }
    else
    cout<<t-1;
   return 0;
}