def max_sub_array_sum_repeated(a, n, k):
    if n == 0 or k <= 0:
        return 0

    total_sum = 0
    max_ending = a[0]
    max_so_far = a[0]
    prefix_sum = 0
    max_prefix = a[0]

    suffix_sum = 0
    max_suffix = a[-1]

    for i in range(n):
        x = a[i]
        total_sum += x

        if i > 0:
            max_ending = max(x, max_ending + x)
            if max_ending > max_so_far:
                max_so_far = max_ending

        prefix_sum += x
        if prefix_sum > max_prefix:
            max_prefix = prefix_sum

    for i in range(n - 1, -1, -1):
        suffix_sum += a[i]
        if suffix_sum > max_suffix:
            max_suffix = suffix_sum

    if k == 1:
        return max_so_far

    result = max(max_so_far, max_suffix + max_prefix)
    if total_sum > 0:
        result = max(result, max_suffix + max_prefix + (k - 2) * total_sum)

    return result