#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

template <typename Ring>
std::vector<Ring> fast_zeta_transform(
    std::vector<Ring> a, const bool adds_superset, const Ring ID = 0,
    const std::function<Ring(const Ring&, const Ring&)> fn =
        [](const Ring& a, const Ring& b) -> Ring { return a + b; }) {
  int n = a.size(), p = 1;
  while ((1 << p) < n) ++p;
  n = 1 << p;
  a.resize(n, ID);
  if (adds_superset) {
    for (int i = 1; i < n; i <<= 1) {
      for (int s = 0; s < n; ++s) {
        if (s & i) continue;
        a[s] = fn(a[s], a[s | i]);
      }
    }
  } else {
    for (int i = 1; i < n; i <<= 1) {
      for (int s = 0; s < n; ++s) {
        if (s & i) continue;
        a[s | i] = fn(a[s | i], a[s]);
      }
    }
  }
  return a;
}

int main() {
  constexpr int S = 5;
  int n, k; cin >> n >> k;
  vector<string> s(n); REP(i, n) cin >> s[i];
  vector<int> w(k + 1, 1);
  REP(i, k) w[i + 1] = w[i] * S;
  vector<int> a(w[k], 0);
  REP(i, n) {
    int v = 0;
    for (const char c : s[i]) {
      v = v * S + (c - '0');
    }
    a[v] = 1;
  }
  REP(i, k) {
    REP(x, w[k]) {
      if (x / w[i] % S < S - 1) a[x + w[i]] += a[x];
    }
  }
  int ans = 0;
  REP(i, n) {
    int v = 0;
    for (const char c : s[i]) {
      v = v * S + (c - '0');
    }
    ans += a[v] > 1;
  }
  cout << ans << '\n';
  return 0;
}