B"There are N arrays, each array has M positive integer elements The j -th element of the i -th array is A_{i,j} . Initially, Chaneka's digital wallet contains 0 money. Given an integer K . Chaneka will do M-K+1 operations. In the p -th operation, Chaneka does the following procedure: Determine the maximum total money that can be earned! The first line contains three integers N , M , and K ( 1 <= q N <= q 10 ; 1 <= q M <= q 10^5 ; 1 <= q K <= q min(10, M) ) -- the number of arrays, the size of each array, and the constant that describes the operation constraints. The i -th of the next N lines contains M integers A_{i,1}, A_{i,2}, ldots, A_{i,M} ( 1 <= q A_{i,j} <= q 10^6 ) -- the elements of the i -th array. Output an integer representing the maximum total money that can be earned. In the first example, the following is a sequence of operations of one optimal strategy: So the total money earned is 10+8+9=27 . In the second example, the following is a sequence of operations of one optimal strategy: So the total money earned is 8+9=17 . In the third example, the following is a sequence of operations of one optimal strategy: So the total money earned is 10+9=19 . "...