No tag edit access

The problem statement has recently been changed. View the changes.

×
A. Good Number

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputLet's call a number *k*-good if it contains all digits not exceeding *k* (0, ..., *k*). You've got a number *k* and an array *a* containing *n* numbers. Find out how many *k*-good numbers are in *a* (count each number every time it occurs in array *a*).

Input

The first line contains integers *n* and *k* (1 ≤ *n* ≤ 100, 0 ≤ *k* ≤ 9). The *i*-th of the following *n* lines contains integer *a*_{i} without leading zeroes (1 ≤ *a*_{i} ≤ 10^{9}).

Output

Print a single integer — the number of *k*-good numbers in *a*.

Examples

Input

10 6

1234560

1234560

1234560

1234560

1234560

1234560

1234560

1234560

1234560

1234560

Output

10

Input

2 1

1

10

Output

1

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Feb/25/2021 10:48:30 (f1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|