// UUID: 28908013-1816-4e7d-9f96-5366a1d033c0
#include <bits/stdc++.h>
 
using namespace std;
 
#define ll long long
#define fs first
#define sc second
#define pb push_back
#define pll pair<ll, ll>
#define vll vector<ll>
#define v2ll vector<vll>
#define pqll priority_queue<ll>

const ll mod = 1e9+7;
const ll inf = LONG_LONG_MAX;

ll n, k;

void solve()
{
    cin >> n >> k;
    vector<pll> v(n);
    for (pll &i : v) cin >> i.fs >> i.sc;
    ll pos = n;
    vector<pll> dists;
    while(pos > 0) {
        ll ind = pos-1, dist = 0, mn = 1000, mni = pos-1, disti = 0;
        while(ind >= 0 && dist+v[ind].fs <= k) {
            dist += v[ind].fs;
            if (v[ind].sc < mn) {
                mn = v[ind].sc;
                mni = ind;
                disti = dist;
            }
            ind--;
        }
        pos = mni;
        dists.push_back({pos, disti});
    }
    reverse(dists.begin(), dists.end());
    ll ans = 0, tank = 0;
    vector<pll> vans;
    for (ll i = 0; i < dists.size(); i++) {
        if (i == dists.size()-1 || v[dists[i].fs].sc > v[dists[i+1].fs].sc) {
            ans += (dists[i].sc-tank)*v[dists[i].fs].sc;
            vans.push_back({dists[i].fs+1, dists[i].sc-tank});
            tank = 0;
        }
        else {
            ans += (k-tank)*v[dists[i].fs].sc;
            vans.push_back({dists[i].fs+1, k-dists[i].sc});
            tank = k-dists[i+1].sc;
        }
    }
    cout << ans  << ' ' << vans.size() << '\n';
    for (pll i : vans) cout << i.fs << ' ' << i.sc << '\n';
}
 
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    ll t = 1;
    //cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}