#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define slld(t) scanf("%lld",&t)
#define sd(t) scanf("%d",&t)
#define sc(x) scanf("%s",x)
#define pd(t) prllf("%d\n",t)
#define plld(t) prllf("%lld\n",t)
#define mp(a,b) make_pair(a,b)
#define pii pair<ll,ll> 
#define pli pair<ll,ll>
#define pil pair<ll,ll>  
#define pll pair<ll,ll>
#define ff first
#define ss second
#define pb(x) push_back(x)
#define ub upper_bound
#define lb lower_bound
#define all(x) x.begin(),x.end()
#define sz(x) (ll)x.size()
#define clr(x) memset(x,0,sizeof(x))
#define sws ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define pi acos(-1)
#define rep(I, N) for (ll I = 0; I < (N); ++I)
#define repp(I, a, B) for (ll I = (a); I <= (B); ++I)
using namespace std;
#define TRACE

#ifdef TRACE
#define t(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
    cout << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
    const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define t(...)
#endif
string itos(ll i) 
{
    string s = "";
    while(i)
    {
        s += char(i % 10 + '0');
        i /= 10; 
    }
    reverse(all(s));  
    return s; 
}
ll stoi(string &s) 
{
    ll tot = 0; 
    for (ll i = (ll)s.length() - 1, j = 1; i >= 0; i--, j *= 10) 
    {
        tot += j * (s[i] + '0'); 
    }  
    return tot; 
}
ll gcd(ll a, ll b)
{
    if(b == 0)  return a;
     return gcd(b, a%b);
}
ll lcm(ll a, ll b)
{
    return (a*b*1LL) / gcd(a, b);
}    
/*
bool isPrime[MAX];
void sieve(ll n) 
{
    for(ll i = 0; i <= n;++i) 
    {
        isPrime[i] = true;
    }
    isPrime[0] = false;
    isPrime[1] = false;
    for(ll i = 2; i * i <= n; ++i) 
    {
         if(isPrime[i] == true) 
         {
             for(ll j = i * i; j <= n ;j += i)
                 isPrime[j] = false;
        }
    }
}*/   
ll pwr(ll base, ll p, ll mod)
{
    if(p < 0) p += mod - 1;
    ll ans = 1;
    while(p)
    {
        if(p & 1) ans = (ans * base) % mod;
        base = (base * base) % mod;
        p /= 2;
    }
    return ans;
}                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                   

const ll N = 2e5 + 5;
const ll M = 2e5 + 5;
const ll LN = 30;
const ll BLOCK = 1000;
const ll MAX = 2e6 + 5;
const ll MOD = 1e9 + 7;


//


signed main()
{
    sws;
    srand(time(NULL));
    cout << fixed << setprecision(10);
    clock_t clk;
    clk = clock();
    

    //freopen("input.txt", "r", stdin);  freopen("input.txt", "w", stdout);


    ll n, m;
    cin >> n >> m;
    vector<pair<ll,ll>> cans(n + 1);// cost cans
    repp(i,1,n) cin >> cans[i].ff >> cans[i].ss;
    sort(cans.begin(), cans.end());
    vector<ll> pre(n + 1, 0);
    repp(i,1,n) pre[i] = pre[i - 1] + cans[i].ss;
    ll ans = 0;
    ll idx = lower_bound(pre.begin(), pre.end(), m) - pre.begin();
    repp(i,1,idx-1) ans += (ll)cans[i].ff * (ll)cans[i].ss;
    ans += (m - pre[idx - 1]) * cans[idx].ff;
    cout << ans << "\n";
    

    clk = clock() - clk;
    cerr << fixed << setprecision(6) << "Time: " << ((double)clk)/CLOCKS_PER_SEC << "\n";
    
    return 0;
}

Measured memory_bytes: 2560