#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve()
{
    ll n, m;
    cin >> n >> m;
    vector<pair<ll, pair<ll, ll>>> a(n);
    for (int i = 0; i < n; i++)
        cin >> a[i].first >> a[i].second.first >> a[i].second.second;
    sort(a.begin(), a.end());
    ll ans = 0;
    while (m)
    {
        auto p = a.back();
        if (m < p.second.second)
        {
            ans += m * p.first;
            m = 0;
        }
        else
        {
            ans += p.second.second * p.first;
            m -= p.second.second;
        }
        a.pop_back();
    }
    cout << ans;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    // cin>>t;
    while (t--)
        solve();
    return 0;
}