#include <iostream>
#include <iomanip>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <algorithm>
#include <numeric>
#include <utility>
#include <random>
#include <chrono>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
//const int mod = 1e9+7;
const int MAXN = 110;
double d[MAXN], h[MAXN];
int N;
double D, H;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

double solve(int idx) {
    if(d[idx] == D) {
        return H;
    }
    return ((H + h[idx])*(D-d[idx]) + h[idx]*d[idx] - H*D)/(D - d[idx]);
}

int main() {
    quickread();
    cin >> N >> D >> H;
    for (int i = 0; i < N; i++) {
        cin >> d[i] >> h[i];
    }
    double res = 0;
    for (int i = 0; i < N; i++) {
        res = max(solve(i), res);
    }
    cout << fixed << setprecision(6) << res << endl;
    return 0;
}

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

ll K,N,M;
class Node{
public:
    ll diff,b,pos;
    Node(ll _d = 0,ll _b = 0,ll _p = 0):diff(_d),b(_b),pos(_p){

    }
};
bool operator < (const Node &A,const Node &B){
    return A.diff > B.diff;
}
void solve(){
    vector<ll> vec;
    for(int i=0;i<K;i++){
        ll value;
        cin >> value;
        vec.push_back(value);
    }
    vector<Node> vn;
    vector<ll> res(K,0);
    ll sum = 0;
    for(int i=0;i<K;i++){
        ll bi = vec[i]*M/N;
        ll diff = abs(bi*N - vec[i]*M);
        sum += bi;
        vn.push_back(Node(diff,bi,i));
    }
    ll leave = M-sum;
    sort(vn.begin(),vn.end());
    // for(int i = 0;i< K;i++){
    //     cout << vn[i].diff << " " << vn[i].b << " " << vn[i].pos << endl;
    // }
    for(int i = 0;i<leave;i++){
       vn[i].b += 1;
    }
    for(int i = 0;i< K;i++){
        res[vn[i].pos] = vn[i].b;
    }
    for(int i = 0;i< K;i++){
        cout << res[i] << (i == K-1? '\n':' ');
    }
}
int main(void){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> K >> N >> M;
    solve();

    return 0;
}