#include <bits/stdc++.h>

#define NMax 1002
using namespace std;
ifstream f("matrix.in");
ofstream g("matrix.out");

int n,m,ANS,nu;
char x[NMax];
int v[NMax];
int A[NMax][NMax],M[NMax][NMax],a[NMax][NMax];

int main()
{
    f >> n >> m;
    f.get();
    for(int i = 1; i <= n; ++i){
        f.getline(x,NMax);
        for(int j = 0; j < n; ++j){
            A[i][j + 1] = x[j] - 'a';
        }
    }
    for(int i = 1; i <= m; ++i){
        f.getline(x,NMax);
        for(int j = 0; j < m; ++j){
            v[x[j] - 'a']++;
        }
    }
    for(int lit = 0; lit <= 'z' - 'a'; ++lit){
        for(int i = 1; i <= n; ++i){
            for(int j = 1; j <= n; ++j){
                M[i][j] = M[i - 1][j] + M[i][j - 1] - M[i - 1][j - 1];
                if(A[i][j] == lit){
                    M[i][j] ++;
                }
            }
        }
        for(int i = m; i <= n; ++i){
            for(int j = m; j <= n; ++j){
                int ok = 0;
                int Nr = M[i][j] - M[i - m][j] - M[i][j - m] + M[i - m][j - m];
                if(v[lit] != Nr){
                    if(a[i][j] == 0){
                        a[i][j] = 1;
                        nu++;
                    }
                }
            }
        }
    }
    g << (n - m + 1)*(n - m + 1) - nu << '\n';
    return 0;
}