Fox Ciel is playing a game with numbers now. 

Ciel has *n* positive integers: *x*<sub class="lower-index">1</sub>, *x*<sub class="lower-index">2</sub>, ..., *x*<sub class="lower-index">*n*</sub>. She can do the following operation as many times as needed: select two different indexes *i* and *j* such that *x*<sub class="lower-index">*i*</sub> &gt; *x*<sub class="lower-index">*j*</sub> hold, and then apply assignment *x*<sub class="lower-index">*i*</sub> = *x*<sub class="lower-index">*i*</sub> - *x*<sub class="lower-index">*j*</sub>. The goal is to make the sum of all numbers as small as possible.

Please help Ciel to find this minimal sum.
The first line contains an integer *n* (2 ≤ *n* ≤ 100). Then the second line contains *n* integers: *x*<sub class="lower-index">1</sub>, *x*<sub class="lower-index">2</sub>, ..., *x*<sub class="lower-index">*n*</sub> (1 ≤ *x*<sub class="lower-index">*i*</sub> ≤ 100).
casos = int(input())
limite = int(input())
numeros = [x for x in range(0,limite+1)]
contadorCorrectos = 0
for k in range(casos):
    #Comparar cada numero
    numero = int(input())
    contadorDigito = 0
    while numero>0:
        #Procesar el ultimo dgito
        digito = numero%10
        numero//=10
        if digito in numeros:
            contadorDigito+=1
    if contadorDigito >=limite+1:
        contadorCorrectos+=1
print(contadorCorrectos)