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

    n = min(n, len(a))

    if index < 0 or k < 0 or index >= n or k >= n or k <= index:
        return 0

    target_value = a[k]
    dp = [0] * n

    for i in range(index + 1):
        if a[i] >= target_value:
            continue

        best_before = 0
        for j in range(i):
            if a[j] < a[i] and dp[j] > best_before:
                best_before = dp[j]

        dp[i] = best_before + a[i]

    best_sum = 0
    for i in range(index + 1):
        if a[i] < target_value and dp[i] > best_sum:
            best_sum = dp[i]

    return best_sum + target_value