Problem: You have a playlist consisting of n songs. The i-th song is characterized by two numbers t_i and b_i — its length and beauty respectively. The pleasure of listening to set of songs is equal to the total length of the songs in the set multiplied by the minimum beauty among them. For example, the pleasure of listening to a set of 3 songs having lengths [5, 7, 4] and beauty values [11, 14, 6] is equal to (5 + 7 + 4) ⋅ 6 = 96.

You need to choose at most k songs from your playlist, so the pleasure of listening to the set of these songs them is maximum possible.

Input

The first line contains two integers n and k (1 ≤ k ≤ n ≤ 3 ⋅ 10^5) – the number of songs in the playlist and the maximum number of songs you can choose, respectively.

Each of the next n lines contains two integers t_i and b_i (1 ≤ t_i, b_i ≤ 10^6) — the length and beauty of i-th song.

Output

Print one integer — the maximum pleasure you can get.

Examples

Input


4 3
4 7
15 1
3 6
6 8


Output


78


Input


5 3
12 31
112 4
100 100
13 55
55 50


Output


10000

Note

In the first test case we can choose songs {1, 3, 4}, so the total pleasure is (4 + 3 + 6) ⋅ 6 = 78.

In the second test case we can choose song 3. The total pleasure will be equal to 100 ⋅ 100 = 10000.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  vector<pair<int, int> > V;
  for (int i = 1; i <= n; i++) {
    int x, y;
    cin >> x >> y;
    V.push_back({y, x});
  }
  sort(V.begin(), V.end());
  multiset<int> S;
  long long int ans = 0LL;
  long long int sum = 0LL;
  for (int i = n - 1; i >= 0; i--) {
    int beauty = V[i].first;
    int len = V[i].second;
    sum += len;
    S.insert(len);
    int l = 1;
    auto it = S.begin();
    while (S.size() > k) {
      sum -= *it;
      S.erase(it);
      it++;
      if (it == S.end()) {
        break;
      }
    }
    ans = max(ans, 1LL * sum * beauty);
  }
  cout << ans << endl;
  return 0;
}