#OJ1345. and Lucky Numbers
and Lucky Numbers
and Lucky Numbers
Time Limit: 1 Sec Memory Limit: 64 MB
Description
Roma (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
There are multiple test cases. For each test case, The first line contains two integers n, k (1 ≤ n, k ≤ 100). The second line contains n integers ai (1 ≤ ai ≤ 109) — the numbers that Roma has.
The numbers in the lines are separated by single spaces.
Output
For each test case, Print a single line print a single integer — the answer to the problem.
Sample Input
3 4
1 2 4
Sample Output
3
HINT
In the sample all numbers contain at most four lucky digits, so the answer is 3.