кузнечик

#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
#include <stack>
#include <set>
#include <map>
#define pii pair <int,int>
#define vec vector
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
void cv(vector <int> &v){
    for (auto x: v) cout<<x+1<<' ';
    cout<<"\n";
}

void cvl(vector <ll> &v){
    for (auto x: v) cout<<x<<' ';
    cout<<"\n";
}


void cvv(vector <vector <int> > &v){
    for (auto x: v) cv(x);
    cout<<"\n";
}

void cvb(vector <bool> v){
    for (bool x: v) cout<<x<<' ';
    cout<<"\n";
}

void cvs(vector <string>  v){
    for (auto a: v){
        cout<<a<<"\n";
    }
}

void cvp(vector <pii> a){
    for (auto p: a){
        cout<<p.first<<' '<<p.second<<"\n";
    }
    cout<<"\n";
}


bool sh=0;
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n,k; cin>>n>>k;
    vector <int> a(n,0); for (int i = 1; i <= n - 2; ++i) cin>>a[i];
    vector <int> dp(n, 0), pr(n,-1);
    for (int i = 1; i <= min(n-1, k); ++i){
        dp[i] = a[i];
        pr[i] = 0;
    }
    for (int i = 1; i < n; ++i){
        for (int j = max(0,i - k); j <= i - 1; ++j){
            if (dp[i] < dp[j] + a[i]){
                dp[i] = dp[j] + a[i];
                pr[i]  = j;
            }
        }
    }
    if (sh) cout<<"res\n";
    cout<<dp[n-1]<<"\n";;
    vector <int> ans = {n-1};
    int v = n  - 1;
    if (sh){
        cout<<"dp\n";
        cv(dp);
        cout<<"pr\n";
        cv(pr);
    }
    while (pr[v] != 0){
        v  = pr[v];
        ans.push_back(v);
    }
    ans.push_back(0);
    reverse(ans.begin(), ans.end());
    cout<<ans.size()-1<<"\n";
    cv(ans);
}
/*

5 3
2 -3 5
*/