#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N,K;
ll from[52][2];
ll to[52][2];


void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>K;
	FOR(i,K+1) from[i][0]=from[i][1]=-1LL<<60;
	from[0][0]=0;
	FOR(i,N) {
		cin>>k;
		FOR(j,K+1) to[j][0]=to[j][1]=-1LL<<60;
		FOR(j,K+1) {
			to[j][0]=max(to[j][0],from[j][0]);
			to[j][0]=max(to[j][0],from[j][1]);
			to[j+1][1]=max(to[j+1][1],from[j][0]+k);
		}
		
		swap(from,to);
	}
	ll ma=max(from[K][0],from[K][1]);
	if(ma<-1LL<<50) {
		cout<<"Impossible"<<endl;
	}
	else {
		cout<<ma<<endl;
	}
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}