def max_sum_increasing_subseq(a, n, index, k):
    if not a or n <= 0 or index < 0 or k < 0 or index >= n or k >= n or k <= index:
        return 0

    target = a[k]
    dp = [0] * n
    best = 0

    for i in range(index + 1):
        if a[i] < target:
            dp[i] = a[i]
            for j in range(i):
                if a[j] < a[i] and dp[j] > 0:
                    cand = dp[j] + a[i]
                    if cand > dp[i]:
                        dp[i] = cand
            if dp[i] > best:
                best = dp[i]

    return best + target if best > 0 else target