You have $N$ items that you want to put them into a knapsack of capacity $W$. Item $i$ ($1 \le i \le N$) has weight $w_i$ and value $v_i$ for the weight.

When you put some items into the knapsack, the following conditions must be satisfied:

* The total value of the items is as large as possible.
* The total weight of the selected items is at most $W$.
* You can break some items if you want. If you put $w'$($0 \le w' \le w_i$) of item $i$, its value becomes $\displaystyle v_i \times \frac{w'}{w_i}.$



Find the maximum total value of items in the knapsack.

Constraints

* $1 \le N \le 10^5$
* $1 \le W \le 10^9$
* $1 \le v_i \le 10^9 (1 \le i \le N)$
* $1 \le w_i \le 10^9 (1 \le i \le N)$

Input


$N$ $W$
$v_1$ $w_1$
$v_2$ $w_2$
:
$v_N$ $w_N$


The first line consists of the integers $N$ and $W$. In the following $N$ lines, the value and weight of the $i$-th item are given.

Output

Print the maximum total value of the items in a line. The output must not contain an error greater than $10^{-6}$.

Examples

Input

3 50
60 10
100 20
120 30


Output

240


Input

3 50
60 13
100 23
120 33


Output

210.90909091


Input

1 100
100000 100000


Output

100
#include<bits/stdc++.h>
using namespace std;
using ll = long long;

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")

const ll mod = 1e9 + 7;
const ll inf = 1e18;

template < typename T >
void vprint(T &V){
	for(auto v : V){
    	cout << v << " ";
	}
	cout << endl;
}

struct Item{
    ll w;
    ll v;
    Item(ll w, ll v):w(w), v(v){}
    bool operator<(const Item &another) const
    {
        return v * another.w < w * another.v;
    }
    bool operator>(const Item &another) const
    {
        return v * another.w > w * another.v;
    }
    string ToString(){
        stringstream ss;
        ss << w << ' ' << v;
        return ss.str();
    }
};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    ll N, W;
    cin >> N >> W;

    vector<Item> A;
    FOR(i, 0, N){
        ll v, w; cin >> v >> w;
        A.push_back(Item(w, v));
    }
    sort(ALL(A), greater<Item>());
    
    double sum = 0;
    for(auto item : A){
        if(item.w <= W){
            W -= item.w;
            sum += item.v;
        }else{
            double r = (double)item.v / item.w;
            sum += r * W;
            W = 0;
        }
    }

    cout << setprecision(20);
    p(sum);

    return 0;
}
