#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/modint>
// using namespace atcoder;
// using mint = modint998244353;
using ll = long long;
#define fix(x) fixed << setprecision(x)
#define rep(i, n) for(int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}
constexpr ll INFLL = (1LL << 62), MOD = 998244353;
constexpr int INF = (1 << 30);

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,k;
    cin >> n >> k;
    vector dp(k+1,vector<ll>(2,-INFLL));
    dp[0][0] = 0;
    rep(i,n){
        vector upd(k+1,vector<ll>(2,-INFLL));
        ll a;
        cin >> a;
        rep(j,k+1){
            if(j<k) chmax(upd[j+1][1], dp[j][0]+a);
            chmax(upd[j][0], dp[j][0]);
            chmax(upd[j][0], dp[j][1]);
        }
        swap(dp,upd);
    }
    ll ans = max(dp[k][0], dp[k][1]);
    if(ans<(-1LL<<40)) cout << "Impossible\n";
    else cout << ans<< '\n';
    return 0;
}