def max_sub_array_sum_repeated(a, n, k):
	 
	max_so_far = -2147483648
	max_ending_here = 0
	for i in range(n*k): 
		max_ending_here = max_ending_here + a[i%n] 
		if (max_so_far < max_ending_here): 
			max_so_far = max_ending_here 
		if (max_ending_here < 0): 
			max_ending_here = 0
	return max_so_far
def max_sub_array_sum_repeated(a, n, k):
    max_so_far = -2147483648
    max_ending_here = 0
    for i in range(n * k):
        _i_5 = 0
        while _i_5 < _i_5:
            if max_ending_here < 0:
                max_ending_here = 0
        max_ending_here = max_ending_here + a[i % n]
       
        if max_so_far < max_ending_here:
            max_so_far = max_ending_here
        if max_ending_here < 0:
            max_ending_here = 0
    return max_so_far