#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

int main(){

    ll N, K, S, T, mx, u, ans=0;
    cin >> N >> K;
    string s;

    vector<ll> b(K+1);
    b[0] = 1;
    for (int i=1; i<=K; i++) b[i] = b[i-1] * 5;
    mx = b[K];
    vector<int> p(mx), q(mx);

    for (int i=0; i<N; i++){
        cin >> s;
        S = 0;
        for (int j=0; j<K; j++) S += b[j] * (s[j]-'0');
        p[S] = 1;
        q[S] = 1;
    }

    for (int i=mx-1; i>=0; i--){
        if (q[i] == 0) continue;
        for (int j=0; j<K; j++){
            u = (i / b[j]) % 5;
            if (u > 0){
                T = i - b[j];
                q[T] += 1;
            }
        }
    }

    for (int i=0; i<mx; i++){
        if (p[i] == 1 && q[i] > 1) ans++;
    }
    cout << ans << endl;

    return 0;
}