#pragma GCC optimize ("O3,inline,omit-frame-pointer,no-asynchronous-unwind-tables,fast-math")
#include <bits/stdc++.h>
#include <unordered_map>
#include <stdlib.h>
using namespace std;
#define rep(i, a, n) for(ll i = a; i < n; i++)
#define rrep(i, a, n) for(ll i = a; i >= n; i--)
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
//constexpr ll MOD = 1000000007;
constexpr ll MOD = 998244353;
constexpr int IINF = 1001001001;
constexpr ll INF = 1LL<<60;
#define all(x) (x).begin(), (x).end()

template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}

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