#include <iostream>
#include <fstream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <iomanip>
#include <deque>
#include <climits>
#include <bitset>
using namespace std;
int a['z'-'a'+1][1001][1001], i, j, n, m, fv['z'-'a'+1], idk, nr;
char x;
bool ok;
int main()
{
ifstream cin ("matrix.in");
ofstream cout ("matrix.out");
cin >> n >> m;
for ( i = 1; i <= n; i++ ) {
for ( j = 1; j <= n; j++ ) {
for ( idk = 0; idk <= 'z'-'a'; idk++ ) {
a[idk][i][j] = a[idk][i][j-1]+a[idk][i-1][j]-a[idk][i-1][j-1];
}
cin >> x;
a[x-'a'][i][j]++;
}
}
for ( i = 1; i <= m; i++ ) {
for ( j = 1; j <= m; j++ ) {
cin >> x;
fv[x-'a']++;
}
}
for ( i = m; i <= n; i++ ) {
for ( j = m; j <= n; j++ ) {
ok = 0;
for ( idk = 0; idk <= 'z'-'a' && ok == 0; idk++ ) {
if ( a[idk][i][j]-a[idk][i-m][j]-a[idk][i][j-m]+a[idk][i-m][j-m] != fv[idk] ) {
ok = 1;
}
}
nr += (ok==0);
}
}
cout << nr;
return 0;
}