Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

No tag edit access

A. Roma and Lucky Numbers

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputRoma (a popular Russian name that means 'Roman') loves the Little Lvov Elephant's lucky numbers.

Let us remind you that lucky numbers are positive integers whose decimal representation only contains lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.

Roma's got *n* positive integers. He wonders, how many of those integers have not more than *k* lucky digits? Help him, write the program that solves the problem.

Input

The first line contains two integers *n*, *k* (1 ≤ *n*, *k* ≤ 100). The second line contains *n* integers *a*_{i} (1 ≤ *a*_{i} ≤ 10^{9}) — the numbers that Roma has.

The numbers in the lines are separated by single spaces.

Output

In a single line print a single integer — the answer to the problem.

Examples

Input

3 4

1 2 4

Output

3

Input

3 2

447 44 77

Output

2

Note

In the first sample all numbers contain at most four lucky digits, so the answer is 3.

In the second sample number 447 doesn't fit in, as it contains more than two lucky digits. All other numbers are fine, so the answer is 2.

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/29/2017 01:48:32 (p1).

Desktop version, switch to mobile version.
User lists

Name |
---|