#include <cstdio>
#include <fstream>

using namespace std;
int a[1009][1009];
int ok[1009][1009];
int frec[250];
int b[1009][1009];

int n,m,i,j,sol,k,ii,jj;
char ch;
ifstream fin("matrix.in");
ofstream fout("matrix.out");

int main()
{

    fin >> n >> m;
    for(i = 1; i <= n; i++)
    {
        for(j = 1; j <= n; j++)
        {
            fin >> ch;
            a[i][j] = ch - 'a';
        }
    }

    for(i = 1; i <= m; i++)
    {
        for(j = 1; j <= m; j++)
        {
            fin >> ch;
            frec[ch - 'a']++;
        }
    }
    //facem sume partiale pentru fiecare litera
    for (k='a';k<='z';k++){
        for (i=1;i<=n;i++)
        {
            for (j=1;j<=n;j++)
            {

                b[i][j] = b[i-1][j] + b[i][j-1] - b[i-1][j-1] + (a[i][j]==k-'a');
            }
        }

        // cautam
        for (i=1;i<=n;i++)
        {
            for (j=1;j<=n;j++){
                //(i,j) este coltul stanga sus
                int lin = i + m - 1;
                int col = j + m - 1;
                //daca gasim o litera care nu corespunde cu frecventa,punem ok[i][j] pe 0
                if (lin > n || col > n || b[lin][col]-b[i-1][col]-b[lin][j-1]+b[i-1][j-1]!=frec[k-'a'])
                    ok[i][j] = 1;
            }
        }
    }
    sol=0;
    for (i=1;i<=n;i++)
    {
         for (j=1;j<=n;j++)
         {
             sol += 1-ok[i][j];
         }
    }


    fout << sol << "\n";
    return 0;
}