#include <fstream>
#include <iostream>
#include <vector>
#include <bitset>
#include <string.h>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <time.h>
#include <stdlib.h>
#include <set>
#include <map>
#include <string>
#include <queue>
#include <deque>

using namespace std;

const char infile[] = "matrix.in";
const char outfile[] = "matrix.out";

ifstream fin(infile);
ofstream fout(outfile);

const int MAXN = 1005;
const int oo = 0x3f3f3f3f;
const int SIGMA = 26;

typedef vector<int> Graph[MAXN];
typedef vector<int> :: iterator It;

const inline int min(const int &a, const int &b) { if( a > b ) return b;   return a; }
const inline int max(const int &a, const int &b) { if( a < b ) return b;   return a; }
const inline void Get_min(int &a, const int b)    { if( a > b ) a = b; }
const inline void Get_max(int &a, const int b)    { if( a < b ) a = b; }

int M, N, dp[MAXN][MAXN], freq[SIGMA];
bitset <MAXN> infected[MAXN];
char human[MAXN][MAXN], virus[MAXN];

inline int key(const char c) {
    return c - 'a';
}

int main() {
    fin >> M >> N;
    for(int i = 1 ; i <= M ; ++ i)
        fin >> (human[i] + 1);
    for(int i = 1 ; i <= N ; ++ i) {
        fin >> (virus + 1);
        for(int j = 1 ; j <= N ; ++ j)
            ++ freq[key(virus[j])];
    }
    for(int i = N ; i <= M ; ++ i)
        for(int j = N ; j <= M ; ++ j)
            infected[i][j] = true;
    for(char c = 'a' ; c <= 'z' ; ++ c) {
        for(int i = 1 ; i <= M ; ++ i)
            for(int j = 1 ; j <= M ; ++ j)
                dp[i][j] = dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1] + (c == human[i][j]);
        for(int i = N ; i <= M ; ++ i)
            for(int j = N ; j <= M ; ++ j)
                if(infected[i][j])
                    if(freq[c - 'a'] != dp[i][j] - dp[i - N][j] - dp[i][j - N] + dp[i - N][j - N])
                        infected[i][j] = false;
    }
    long long Ans = 0;
    for(int i = N ; i <= M ; ++ i)
        Ans += infected[i].count();
    fout << Ans << '\n';
    fin.close();
    fout.close();
    return 0;
}