#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>

using namespace std;

#define pair dsgkfsg

int n, m;
int a[200][200];
vector<bool> used;
vector<int> pair;

bool dfs(int x) {
    if (used[x])
        return false;
    used[x] = true;
    for (int i = 0; i < m; i++)
        if (a[x][i] == 1 && (pair[i] == -1 || dfs(pair[i]))) {
            pair[i] = x;
            return true;
        }
    return false;
}

int main() {
    cin >> m >> n;
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            cin >> a[i][j];
    used.resize(n);
    pair.resize(m);
    for (int i = 0; i < (int)pair.size(); i++)
        pair[i] = -1;

    for (int i = 0; i < n; i++) {
        for (int t = 0; t < (int)used.size(); t++)
            used[t] = false;
        dfs(i);
    }
    int ans = 0;
    for (int i = 0; i < m; i++)
        if (pair[i] != -1)
            ans++;
    cout << ans << endl;

    return 0;
}