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

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define FOR(i, a, b) for (int i = (a); i<(b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i>=(a); --i)
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define FILL(a, b) memset(a, b, sizeof(a))

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

const int mod[2] = {1'000'000'007, 1'000'000'009};

struct Pair {
	int a[2];
	Pair (int x = 0) {
		FOR(i, 0, 2) {
			a[i] = x;
		}
	}
	Pair operator+(const Pair& p) const {
		Pair res;
		FOR(i, 0, 2) {
			res.a[i] = (a[i] + p.a[i]) % mod[i];
		}
		return res;
	}
	Pair operator*(const Pair& p) const {
		Pair res;
		FOR(i, 0, 2) {
			res.a[i] = (LL)a[i] * p.a[i] % mod[i];
		}
		return res;
	}
	bool operator==(const Pair& p) const {
		return a[0] == p.a[0] && a[1] == p.a[1];
	}
};

const int MAX = 22;

int val[MAX], l[MAX], r[MAX], sz[MAX];

Pair getHash(int v) {
	if (v == -1) {
		return 0;
	}
	Pair hl = getHash(l[v]), hr = getHash(r[v]);
	int szL = 0, szR = 0;
	if (l[v] != -1) {
		szL = sz[l[v]];
	}
	if (r[v] != -1) {
		szR = sz[r[v]];
	}
	sz[v] = szL + szR + 1;
	return hl + ((Pair)szL * 47 + (Pair)szL * szL * 7 + (Pair)szL * szL * szL * 4 + 7447) + ((Pair)szL * 44 + (Pair)szL * szR * 77 + (Pair)szL * szR * szR * 474 + 7777) * hr;
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n, k;
	cin >> n >> k;
	vector<Pair> hashes(n);
	FOR(i, 0, n) {
		FILL(l, -1);
		FILL(r, -1);
		FOR(j, 0, k) {
			cin >> val[j];
			if (j > 0) {
				int v = 0;
				while (true) {
					if (val[j] < val[v]) {
						if (l[v] == -1) {
							l[v] = j;
							break;
						}
						else {
							v = l[v];
						}
					}
					else {
						if (r[v] == -1) {
							r[v] = j;
							break;
						}
						else {
							v = r[v];
						}
					}
				}
			}
		}
		hashes[i] = getHash(0);
	}
	int ans = 0;
	FOR(i, 0, n) {
		bool uniq = true;
		FOR(j, 0, i) {
			if (hashes[j] == hashes[i]) {
				uniq = false;
			}
		}
		if (uniq) {
			ans++;
		}
	}
	cout << ans << "\n";
	return 0;
}