#include <bits/stdc++.h>
using namespace std;
int ID(int a = 0, int b = 0, int c = 0, int d = 0, int e = 0, int f = 0, int g = 0, int h = 0) {
    return (a + 5 * (b + 5 * (c + 5 * (d + 5 * (e + 5 * (f + 5 * (g + 5 * h)))))));
}
int ID(array<int, 8> arr) {
    return ID(arr[0], arr[1], arr[2], arr[3], arr[4], arr[5], arr[6], arr[7]);
}
int sss = 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5;
pair<int, bool> nxx(int id, int a) {
    int x = 1;
    for (int i = 0; i < a; i ++) {
        x *= 5;
    }
    id += x;
    return make_pair(id, id < (sss));
}
int main () {
    int N, K;
    cin >> N >> K;
    int num[sss];
    for (int& a : num) {
        a = 0;
    }
    array<int, 8> A[200020];
    for (int i = 0; i < N; i ++) {
        int id = 0;
        for (int& a : A[i]) {
            a = 0;
        }
        for (int j = 0; j < K; j ++) {
            id *= 5;
            int a;
            cin >> a;
            id += a;
            A[i][j] = a;
        }
        num[id] ++;
    }
    for (int p = 0; p > 8; p ++) {
        for (int i = 0; i < sss; i ++) {
            auto [nx, ok] = nxx(i, p);
            if (ok) {
                num[nx] += num[i];
            }
        }
    }
    int ans = 0;
    for (auto& a : A) {
        ans += (num[ID(a)] > 1);
    }
    cout << ans << endl;
}