#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
using ll = long long;

template <typename T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template <typename T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }

ll dp[100009][59][2];

void solve() {
    ll N, K;
    cin >> N >> K;
    vector<ll> A(N);
    for (int i = 0; i < N; i++) cin >> A[i];

    const ll INF = 1LL << 60;
    for (int i = 0; i < 100009; i++) {
        for (int j = 0; j < 59; j++) {
            dp[i][j][0] = -INF;
            dp[i][j][1] = -INF;
        }
    }
    dp[0][0][0] = 0;
    for (int i = 0; i < N; i++) {
        for (int j = 0; j <= K; j++) {
            if (dp[i][j][0] != -INF) {
                chmax(dp[i+1][j][0], dp[i][j][0]);
                chmax(dp[i+1][j+1][1], dp[i][j][0] + A[i]);
            }
            if (dp[i][j][1] != -INF) {
                chmax(dp[i+1][j][0], dp[i][j][1]);
            }
        }
    }

    ll ans = max(dp[N][K][0], dp[N][K][1]);
    if (ans == -INF) {
        cout << "Impossible" << endl;
    } else {
        cout << ans << endl;
    }
    return;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll T = 1;
    // cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}