def max_sum_increasing_subseq(a, n, index, k):
    dp = [0] * n
    for i in range(n):
        dp[i] = a[i]
    
    for i in range(1, n):
        for j in range(i):
            if a[i] > a[j] and dp[i] < dp[j] + a[i]:
                dp[i] = dp[j] + a[i]
    
    if dp[k] == a[k]:
        return 0
    
    return dp[k]