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.
The first line contains two integers *n*, *k* (1 ≤ *n*, *k* ≤ 100). The second line contains *n* integers *a*<sub class="lower-index">*i*</sub> (1 ≤ *a*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">9</sup>) — the numbers that Roma has. 

The numbers in the lines are separated by single spaces.
import sys
import math
import heapq
from collections import defaultdict,Counter,deque
 
input = sys.stdin.readline
 
def I():
    return input()
 
def II():
    return int(input())
 
def MII():
    return map(int, input().split())
 
def LI():
    return list(input().split())
 
def LII():
    return list(map(int, input().split()))
 
def GMI():
    return map(lambda x: int(x) - 1, input().split())
 
def LGMI():
    return list(map(lambda x: int(x) - 1, input().split()))
 
def WRITE(out):
  return print('\n'.join(map(str, out)))
 
def WS(out):
  return print(' '.join(map(str, out)))
 
def WNS(out):
  return print(''.join(map(str, out)))

'''
floor of a[i]
    if even -> could be either (no reason to)
    if odd -> odd

bleh, if odd number of odds -> we could either convert
and even to an odd or an odd to an even

need to find minimum
'''

def solve():
    n,k = MII()
    a = I().split()

    ans = 0
    for num_s in a:
        lucky = 0
        for c in num_s:
            if c == "4" or c == "7":
                lucky += 1
        if lucky <= k:
            ans += 1
    print(ans)


solve()