#include <bits/stdc++.h>

using namespace std;

ifstream fin("matrix.in");
ofstream fout("matrix.out");

int n, m, fr[30], s[1005][1005];
char a[1005][1005], b[1005][1005];
bool stricat[1005][1005];

int main()
{
    fin >> n >> m;
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= n; ++j)
        {
            fin >> a[i][j];
        }
    }
    for (int i = 1; i <= m; ++i)
    {
        for (int j = 1; j <= m; ++j)
        {
            fin >> b[i][j];
            fr[b[i][j] - 'a']++;
        }
    }
    for (char ch = 'a'; ch <= 'z'; ++ch)
    {
        for (int i = 1; i <= n; ++i)
        {
            for (int j = 1; j <= n; ++j)
            {
                s[i][j] = 0;
                if (a[i][j] == ch) s[i][j] = 1;
                s[i][j] += s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1];
            }
        }
        for (int i = 1; i + m - 1 <= n; ++i)
        {
            for (int j = 1; j + m - 1 <= n; ++j)
            {
                if (s[i + m - 1][j + m - 1] - s[i - 1][j + m - 1] - s[i + m - 1][j - 1] + s[i - 1][j - 1] != fr[ch - 'a'])
                    stricat[i][j] = true;
            }
        }
    }
    int contor = 0;
    for (int i = 1; i + m - 1 <= n; ++i)
    {
        for (int j = 1; j + m - 1 <= n; ++j)
        {
            contor += !stricat[i][j];
        }
    }
    fout << contor;
    fin.close();
    fout.close();
    return 0;
}