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 pii = pair<int, int>;
#define mp make_pair
#define ff first
#define ss second
using vi = vector<int>;
using vvi = vector<vi>;
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define debug(x) cout<<#x<<" = "<<(x)<<endl

int main(){
  cout<<fixed<<setprecision(10);
  int N,W;
  cin>>N>>W;
  vector<pii> things;
  int v,w;
  for(int i=0; i<N; i++){
    cin>>v>>w;
    things.pb(mp(v,w));
  }
  sort(all(things), [](pii a, pii b){
    return ((double)a.ff/a.ss) > ((double)b.ff/b.ss);
  });
  /*
  for(pii x: things){
    cout<<x.ff<<","<<x.ss<<endl;
  }
  */
  double ans = 0.0;
  for(int i=0; i<N; i++){
    if(things[i].ss > W){
      ans += (double)things[i].ff*W/things[i].ss;
      cout<<ans<<endl;
      return 0;
    }else{
      ans += things[i].ff;
      W -= things[i].ss;
      //debug(W);
    }
  }
  cout<<ans<<endl;
}
