Hearing that energy drinks increase rating in those sites, Takahashi decides to buy up M cans of energy drinks.

There are N stores that sell energy drinks. In the i-th store, he can buy at most B_i cans of energy drinks for A_i yen (the currency of Japan) each.

What is the minimum amount of money with which he can buy M cans of energy drinks?

It is guaranteed that, in the given inputs, a sufficient amount of money can always buy M cans of energy drinks.

Constraints

* All values in input are integers.
* 1 \leq N, M \leq 10^5
* 1 \leq A_i \leq 10^9
* 1 \leq B_i \leq 10^5
* B_1 + ... + B_N \geq M

Input

Input is given from Standard Input in the following format:


N M
A_1 B_1
A_2 B_2
\vdots
A_N B_N


Output

Print the minimum amount of money with which Takahashi can buy M cans of energy drinks.

Examples

Input

2 5
4 9
2 4


Output

12


Input

4 30
6 18
2 5
3 10
7 9


Output

130


Input

1 100000
1000000000 100000


Output

100000000000000
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;
import java.util.Scanner;

public class Main {
	
	public static class Hoge{
		public int a =  0;
		public int b = 0;
		Hoge(int a, int b){
			this.a = a;
			this.b = b;
		}
	}

	public static void main(String[] args) {

		try (Scanner sc = new Scanner(System.in)) {
			int N = Integer.parseInt(sc.next());
			int M = Integer.parseInt(sc.next());
			List<Hoge> AB = new ArrayList<Hoge>();
			for(int i = 0; i < N; i++) {
				AB.add(new Hoge(Integer.parseInt(sc.next()), Integer.parseInt(sc.next())));
			}
			
			Collections.sort(AB, new Comparator<Hoge>() {
				public int compare(Hoge a1, Hoge a2) {
					return a1.a - a2.a;
				}
			});
			
			long ret = 0L;
			int count = 0;
			for(int i = 0; i < N; i++) {
				if(count >= M) {
					break;
				}
				for(int j = 0; j < AB.get(i).b; j++) {
					if(count >= M) {
						break;
					}
					ret += AB.get(i).a;
					count++;
				}
			}
			System.out.println(ret);
		} // Scanner Close
	}
}