#include<bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pf push_front
#define LC k<<1
#define RC k<<1|1
#define IO cin.sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repn(i, a, n) for (int i = a; i <= n; i++)
#define per(i, a, n) for (int i = (n) - 1; i >= a; i--)
#define pern(i, a, n) for (int i = n; i >= a; i--)

typedef long long LL;
typedef long double LD;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<int, LL> PIL;
typedef pair<LL, int> PLI;
typedef pair<double, double> PDD;
typedef pair<ull, ull> PUU;
typedef pair<LL, LL> PLL;

const int N = 210;
const int M = 1100000;
const int mod = 998244353;
const int inf = (int)1e9;
const LL INF = 1e18;
const double eps = 1e-15;

mt19937_64 Rand((unsigned long long)new char);
#define rand Rand

int n, m, ans, pp[N];
LL a[N][N];
LL pow_mod(LL a, LL e) {
	LL res = 1;
	for (; e; a = a * a % mod, e >>= 1) if (e & 1) res = res * a % mod;
	return res;
}
int main() {
	IO;
	cin >> n >> m;
	repn(i, 1, n) repn(j, 1, m) cin >> a[i][j];
	n = max(n, m);
	repn(i, 1, n) {
		int pos = -1;
		repn(j, 1, n) if (a[j][i] && !pp[j]) {
			pos = j;
			break;
		}
		if (pos == -1) continue;
		repn(j, 1, n) swap(a[i][j], a[pos][j]);
		pp[i] = 1, ans++;
		LL d = pow_mod(a[i][i], mod - 2);
		repn(j, 1, n) a[i][j] = a[i][j] * d % mod;
		repn(j, 1, n) if (i != j) {
			LL coef = a[j][i];
			repn(k, 1, n) a[j][k] = (a[j][k] - coef * a[i][k] % mod + mod) % mod;
		}
	}
	cout << ans << "\n";
			
	return 0;
}