#include <bits/stdc++.h>
using namespace std;

const long long MOD = 1e9 + 7;

long long powerMod(long long a, long long b) {
    long long res = 1;
    a %= MOD;
    while (b > 0) {
        if (b & 1) res = res * a % MOD;
        a = a * a % MOD;
        b >>= 1;
    }
    return res;
}

int main() {
    int n, m;
    cin >> n >> m;

    vector<vector<long long>> a(n, vector<long long>(m));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cin >> a[i][j];
        }
    }

    int rank = 0;

    // Duyet tung cot, dua ve dang bac thang
    for (int col = 0; col < m && rank < n; col++) {
        // Tim hang co phan tu khac 0 tai cot col
        int p = rank;
        while (p < n && a[p][col] == 0) p++;

        if (p == n) continue;  // Cot nay khong co phan tu co so

        // Doi hang p len vi tri rank
        swap(a[rank], a[p]);

        // Chuan hoa hang rank: chia cho a[rank][col]
        long long inv = powerMod(a[rank][col], MOD - 2);
        for (int j = col; j < m; j++) {
            a[rank][j] = a[rank][j] * inv % MOD;
        }

        // Khu cot col o cac hang khac
        for (int i = 0; i < n; i++) {
            if (i != rank && a[i][col] != 0) {
                long long factor = a[i][col];
                for (int j = col; j < m; j++) {
                    a[i][j] = (a[i][j] - factor * a[rank][j] % MOD + MOD) % MOD;
                }
            }
        }

        rank++;
    }

    cout << rank << endl;
    return 0;
}