Codeforces-Strange Game On Matrix（暴力直接写）

C. Strange Game On Matrix

time limit per test：1 seconds

memory limit per test：256 megabytes

input：standard input

output：standard output

Ivan is playing a strange game.

He has a matrix a with n rows and m columns. Each element of the matrix is equal to either 0 or 1. Rows and columns are 1-indexed. Ivan can replace any number of ones in this matrix with zeroes. After that, his score in the game will be calculated as follows:

1. Initially Ivan's score is 0;
2. In each column, Ivan will find the topmost 1 (that is, if the current column is j, then he will find minimum i such that a_i, j = 1). If there are no 1's in the column, this column is skipped;
3. Ivan will look at the next min(k, n - i + 1) elements in this column (starting from the element he found) and count the number of 1's among these elements. This number will be added to his score.

Of course, Ivan wants to maximize his score in this strange game. Also he doesn't want to change many elements, so he will replace the minimum possible number of ones with zeroes. Help him to determine the maximum possible score he can get and the minimum possible number of replacements required to achieve that score.

Input

The first line contains three integer numbers n, m and k (1 ≤ k ≤ n ≤ 100, 1 ≤ m ≤ 100).

Then n lines follow, i-th of them contains m integer numbers — the elements of i-th row of matrix a. Each number is either 0 or 1.

Output

Print two numbers: the maximum possible score Ivan can get and the minimum number of replacements required to get this score.

Examples

Input

4 3 2
0 1 0
1 0 1
0 1 0
1 1 1

Output

4 1

Input

3 2 1
1 0
0 1
0 0

Output

2 0

Note

In the first example Ivan will replace the element a_1, 2.

题意：给一个n*m的矩阵，从每一列的第一个1开始，往下min(n-i+1,k)个数中，有几个1 score就加几，可以把1改成0，问为了得到最大分数最少改变几个1；

思路：数据范围这么小，直接按题意写就行了啊

AC代码：

#include
#include
#include
#include
#include