#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i,n)for (int i = 0; i < int(n); ++i)
#define rrep(i,n)for (int i = int(n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template<class T> void chmax(T& a, const T& b) {a = max(a, b);}
template<class T> void chmin(T& a, const T& b) {a = min(a, b);}
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    VL a(n);
    rep(i, n) cin >> a[i];
    constexpr ll INF = 1002003004005006007;
    VVL dp(n + 1, VL(m + 1, -INF));
    dp[0][0] = 0;
    rep(i, n + 1) rep(j, m + 1) {
        if (i) chmax(dp[i][j], dp[i - 1][j] + (j & 1 ? -1 : 1) * a[i - 1]);
        if (j) chmax(dp[i][j], dp[i][j - 1]);
    }
    VI ans;
    int i = n, j = m;
    while(i || j) {
        if (i && dp[i][j] == dp[i - 1][j] + (j & 1 ? -1 : 1) * a[i - 1]) i--;
        else if (j && dp[i][j] == dp[i][j - 1]) j--, ans.push_back(i);
    }
    rrep(i, m) cout << ans[i] << '\n';
    cerr << dp[n][m] << endl;
}