n, k = map(int, input().split())
a = list(map(int, input().split()))

dp = [[[-10**32, -10**32] for _ in range(k+1)] for i in range(n+1)]
dp[0][0][1] = 0
for i in range(n):
    dp[i+1][0][1] = 0
    for j in range(1, k+1):
        dp[i+1][j][1] = max(dp[i][j][1], dp[i][j][0])
        dp[i+1][j][0] = max(dp[i][j][0], dp[i][j-1][1] + a[i])

if max(dp[n][k]) < -10**20:
    print("Impossible")
else:
    print(max(dp[n][k]))