import java.math.BigInteger;
import java.util.*;
public class Main {
    //final static int MOD=(int)1e9+7;
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n=sc.nextInt();
        int k=sc.nextInt();
        StringBuffer M=new StringBuffer();
        for (int i = 0; i < k; i++) {
            M.append(9);
        }
        BigInteger m=new BigInteger(M.toString());
        String []s=new String[n];
        BigInteger []a=new BigInteger[n];
        for (int i = 0; i < n; i++) {
            s[i]=sc.next();
            a[i]=new BigInteger(s[i]);
            a[i].mod(m);
        }
        int ans=0;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j <= i; j++) {
                for (int l = 0; l <= j; l++) {
                    if(a[i].add(a[j].add(a[l])).mod(m).equals(new BigInteger("0"))){
                        ans++;
                    }
                }
            }
        }
        System.out.println(ans);
    }
}