from collections import defaultdict


def solve():
    n, k = map(int, input().split())
    m = pow(10, k) - 1
    a = [0] * n
    for i in range(n):
        a[i] = int(input()) % m
    d = defaultdict(int)
    ans = 0
    for i in range(n):
        d.clear()
        for j in range(i, n):
            d[a[j]] += 1
            ans += d[((m - a[i] - a[j]) % m + m) % m]
    print(ans)


if __name__ == '__main__':
    solve()