Untitled

#include <bits/stdc++.h>

using namespace std;

int n, m, k;
const int MN = 1000;
char a[MN][MN];
bool visited[MN];

int count_str(int pivot) {
    int cnt = 0;
    for (int i = 0; i < n; ++i) {
        bool flag = true;
        for (int j = 0; j < m; ++j) {
            if (a[pivot][j] != a[i][j]) {
                flag = false;
                break;
            }
        }
        visited[i] = flag;
        cnt += flag;
    }
    return cnt;
}

int main()
{
    int t;
    cin >> t;
    
    for (int tc = 1; tc <= t; ++tc) {
        cin >> n >> m >> k;
        
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < m; ++j) {
                cin >> a[i][j];
            }
            visited[i] = false;
        }
        
        int ans = 0;
        
        for (int i = 0; i < n; ++i) {
            if (visited[i]) {
                continue;
            }
            int count_zero = 0;
            for (int j = 0; j < m; ++j) {
                count_zero += a[i][j] == '0';
            }
            if (count_zero <= k && (k - count_zero) % 2 == 0) {
                ans = max(ans, count_str(i));
            }
        }
        
        cout << "Case #" << tc << " " << ans << '\n';
    }
    
    return 0;
}