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

    def kadane(arr):
        best = arr[0]
        current = arr[0]
        for value in arr[1:]:
            current = max(value, current + value)
            best = max(best, current)
        return best

    if k == 1:
        return kadane(a)

    total_sum = sum(a)

    max_prefix_sum = float("-inf")
    current = 0
    for value in a:
        current += value
        if current > max_prefix_sum:
            max_prefix_sum = current

    max_suffix_sum = float("-inf")
    current = 0
    for value in reversed(a):
        current += value
        if current > max_suffix_sum:
            max_suffix_sum = current

    max_two_arrays = kadane(a + a)

    if total_sum > 0:
        return max(max_two_arrays, max_suffix_sum + max_prefix_sum + (k - 2) * total_sum)

    return max_two_arrays