using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;
class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static string[] SList(long n) => Enumerable.Repeat(0, (int)n).Select(_ => ReadLine()).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, k) = (c[0], c[1]);
        var s = SList(n);
        var bitmax = (int)Math.Pow(5, k);
        var exist = new bool[bitmax];
        var upper = Enumerable.Repeat(true, bitmax).ToArray();
        var pow = new int[k];
        for (var i = 0; i < k; ++i) pow[i] = (int)Math.Pow(5, i);
        foreach (var si in s)
        {
            var id = 0;
            for (var i = 0; i < k; ++i) id += (si[i] - '0') * pow[i];
            exist[id] = true;
        }
        for (var b = bitmax - 1; b >= 0; --b)
        {
            var list = new int[k];
            var tmp = b;
            for (var i = 0; i < k; ++i)
            {
                list[i] = tmp % 5;
                tmp /= 5;
            }
            for (var i = 0; i < k; ++i) if (list[i] > 0)
            {
                var prev = b - pow[i];
                if (!upper[b] || exist[b]) upper[prev] = false;
            }
        }
        var ans = 0;
        for (var b = 0; b < bitmax; ++b) if (exist[b] && !upper[b]) ++ans;
        WriteLine(ans);
    }
}