#include <iostream>
#include <set>
#include <algorithm>
int main()
{

    int N, M, tmp;

    std::cin >> N >> M;
    std::set<int> A, B, C, D, OUT;
    for (int i = 0; i < N; i++)
    {
        std::cin >> tmp;
        A.insert(tmp);
    }
    for (int i = 0; i < M; i++)
    {
        std::cin >> tmp;
        B.insert(tmp);
    }

    std::set_union(A.begin(), A.end(),
                   B.begin(), B.end(),
                   std::inserter(C, C.end()));
    std::set_intersection(A.begin(), A.end(),
                          B.begin(), B.end(),
                          std::inserter(D, D.end()));
    std::set_difference(C.begin(), C.end(),
                        D.begin(), D.end(),
                        std::inserter(OUT, OUT.end()));

    for (auto ite = OUT.begin(), end = OUT.end(); ite != end; ite++)
    {
        std::cout << *ite << " ";
    }
    std::cout << std::endl;
}
#include <bits/stdc++.h>

using namespace std;

#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long
#define ull unsigned long long
#define pi 2*acos(0.0)
#define readl(v,n) for(ll i=0;i<n;i++) {ll val; cin>>val; v.pb(val);}
#define readi(v,n) for(int i=0;i<n;i++) {int val; cin>>val; v.pb(val);}
#define srt(v) sort(v.begin(), v.end());
#define rsrt(v) sort(v.rbegin(), v.rend());
#define MIN(v) *min_element(v.begin(), v.end())
#define MAX(v) *max_element(v.begin(), v.end())
#define sz(x) ((ll) (x).size())
#define all(x) (x).begin(), (x).end()
#define rep(i, a, b) for(ll i = (a); i < (b); i++)
#define rep2(i, a, b) for(ll i = (a); i <= (b); i++)
#define vll vector <ll>
#define vii vector <int>
#define pii pair <int, int>
#define pll pair <ll, ll>
#define M 1000007
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl "\n"
#define inf 1000000000000000000
#define ninf -1000000000000000000
#define deb(n) cout<<"--"<<(n)<<"--"<<endl
#define debx(x) cout << #x << " = " << (x) << endl
#define deb2(a,b) cout<<(a)<<"----"<<(b)<<endl
#define debv(v) for(auto x: v) {cout<<x<<", ";} cout<<endl;
#define put(n) cout<<(n)<<endl
#define toDecimal(s) bitset<64>(s).to_ullong()
#define toBinaryStr(n) bitset<64>(n).to_string()
#define toBinary(n) stoll(bitset<64>(n).to_string())

/*
	---- take notes here ----
	
*/

void solve()
{
	int n;
	double D,H;
	cin>>n>>D>>H;
	double maxx=0;
	for(int i=0; i<n; i++)
	{
		double d,h; cin>>d>>h;
		double x=D-d, y=H-h, a=d;
		double b=(y*a)/x;
		double b1=h-b;
		maxx=max(b1,maxx);
	}
	printf("%.4lf",maxx);
}

int main()
{
	FAST
	int t = 1;
	//cin >> t;
	while(t--)
	{
		solve();	
	}

	return 0;
}