#include <bits/stdc++.h>
using namespace std;
#define int long long 
const int nmax = 1e6;
int a[nmax], n, k, s = 0;
int dem (int n, int k)
{
    int cnt = 0;
    while (n)
    {
        if (n % 10 == k)
        {
            cnt++;
        }
        n /= 10;
    }
    return cnt;
}
main()
{
    cin >> n >> k;
    for (int i = 1; i <= n; ++i)
    {
        cin >> a[i];
        s += dem(a[i], k);
    }
    cout << s;
}

#include <iostream>
using namespace std;
int ma[1001], n, k, tam, dem;
int main() 
{
    cin >> n >> k;
    for(int a = 0; a < n; a++)
    {
        cin >> tam;
        while(tam > 0)
        {
            if(k == (tam%10)) dem++;
            tam /= 10;
        }
    }
    cout << dem;
    return 0;
}

$#khanhataon$