// O(N^2)を通す遊び
#pragma GCC optimize ( "O3" )
#pragma GCC optimize ( "unroll-loops" )
#pragma GCC target ( "sse4.2,fma,avx2,popcnt,lzcnt,bmi2" )
#include <bits/stdc++.h>
using namespace std;
int main()
{
  ios_base::sync_with_stdio( false ); cin.tie( nullptr );
  int N , K; cin >> N >> K;
  constexpr uint bound_N = 2e5;
  assert( 1 <= N && N <= bound_N );
  assert( 1 <= K && K <= 8 );
  constexpr uint chain[5] = { 0 , 1 , 3 , 7 , 15 };
  uint S[bound_N] = {};
  string s;
  for( int i = 0 ; i < N ; i++ ){
    cin >> s;
    uint& Si = S[i];
    for( int k = 0 ; k < K ; k++ ){
      ( Si <<= 4 ) |= chain[s[k] - '0'];
    }
  }
  sort( S , S + N );
  int answer = 0;
  for( int i = 0 ; i < N ; i++ ){
    const uint Si = S[i];
    char removed = 0;
    for( int j = i + 1 ; j < N ; j++ ){
      removed |= ( ( Si & S[j] ) == Si );
    }
    removed ? ++answer : answer;
  }
  cout << answer;
}