#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);
    vll dp(n+1), dist(n+1);
    v2ll ans(n+1);
    for (auto &i : v) cin >> i.fs >> i.sc;
    for (ll i = 0; i < n; i++) {
        bool b = false;
        for (ll j = i; j >= 0; j--) {
            if (v[i].fs - dist[j] >= k) {
                b = true;
                if (dp[j] + v[i].sc > dp[i]) {
                    dp[i+1] = dp[j] + v[i].sc;
                    dist[i+1] = v[i].fs;
                    ans[i+1] = ans[j];
                    ans[i+1].pb(i);
                }
                else {
                    dp[i+1] = dp[i];
                    dist[i+1] = dist[i];
                    ans[i+1] = ans[i];
                }
                break;
            }
        }
        if (!b) {
            dp[i+1] = dp[i];
            dist[i+1] = dist[i];
            ans[i+1] = ans[i];
        }
    }
    cout << dp[n] << '\n';
    cout << ans[n].size();
    for (auto i : ans[n]) cout << ' ' << i+1;
}
 
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    ll t = 1;
    //cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}