codeforces——873C —— Strange Game On Matrix

C. Strange Game On Matrix

time limit per test

1 second

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 ai, 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 a1, 2.

有一个n*m的矩阵,由0,1组成....有操作可以把1修改为0

计分方式是统计每列第一个1(包括第一个1),长度为k的数组,拥有1的个数....每列的结果求和

问在最少的操作次数下,能得到的最大结果..

#include <cstring>
#include <queue>
#include <cstdio>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <vector>
#include <iostream>
#include <cmath>
using namespace std;
int main() {
    int n,m,len,in[108][108];
    while(~scanf("%d%d%d",&n,&m,&len)) {
        for(int i=0; i<n; i++)
            for(int j=0; j<m; j++)
                scanf("%d",&in[i][j]);
        int ans1=0,ans2=0;
        for(int j=0; j<m; j++) {
            int large=0,place;
            for(int i=0; i<=n-len; i++) {
                int sum=0;
                for(int k=i; k<i+len; k++)
                    sum+=in[k][j];
                if(sum>large) {
                    large=sum;
                    place=i;
                }
            }
            if(large) {
                ans1+=large;
                for(int i=0; i<place; i++)
                    ans2+=in[i][j];
            }
        }
        printf("%d %d\n",ans1,ans2);
    }
    return 0;
}