N, K = map(int, input().split())
A = tuple(map(int, input().split()))

dp = [[[-10**18]*2 for _ in range(K+1)] for _ in range(N+1)]
dp[0][0][0] = 0

for i in range(N):
  for j in range(K+1):
    for k in range(2):
      if dp[i][j][k] == -10**18:
        continue
      if k == 0:
        if j < K:
          dp[i+1][j+1][1] = max(dp[i+1][j+1][1], dp[i][j][0] + A[i])
        dp[i+1][j][0] = max(dp[i+1][j][0], dp[i][j][0])
      if k == 1:
        dp[i+1][j][0] = max(dp[i+1][j][0], dp[i][j][1])

ans = max(dp[N][K][0], dp[N][K][1])

print(ans if ans != -10**18 else "Impossible")