/** gnu specific **/
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
/** contains everything I need in std **/
#include <bits/stdc++.h>

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(S) ((int)S.size())
#define FOR(i, n) for(int i = 0; i < n; ++i)
#define RFOR(i, n) for(int i = n-1; i >= 0; --i)
#define output_vec(vec) { FOR(i_, sz(vec)) cout << vec[i_] << ' '; cout << '\n'; }
#define x first
#define y second
#define pb push_back
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef vector<bool> vb;
typedef short si;
typedef unsigned long long ull;
typedef long double LD;
typedef pair<ull, ull> pull;
using namespace __gnu_pbds;
typedef tree<ll, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
using namespace std;
#ifdef ONPC
mt19937 rnd(228);
#else
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
#endif

int n, m;
vector<string> a;
bool vis[11][11];
unordered_map<string, bool> dp;

bool f(int x, int y, int p, const string& s)
{
    if(p == sz(s)-1)
        return true;
    vis[x][y] = true;
    bool res = false;
    if(x-1 >= 0 && !vis[x-1][y] && a[x-1][y] == s[p+1])
    {
        res = f(x-1, y, p+1, s);
        if(res) return res;
    }
    if(x+1 < n && !vis[x+1][y] && a[x+1][y] == s[p+1])
    {
        res = f(x+1, y, p+1, s);
        if(res) return res;
    }
    if(y-1 >= 0 && !vis[x][y-1] && a[x][y-1] == s[p+1])
    {
        res = f(x, y-1, p+1, s);
        if(res) return res;
    }
    if(y+1 < m && !vis[x][y+1] && a[x][y+1] == s[p+1])
    {
        res = f(x, y+1, p+1, s);
        if(res) return res;
    }
    vis[x][y] = false;
    return false;
}

bool contains(const string& s)
{
    auto it = dp.find(s);
    if(it != dp.end())
        return it->second;
    for(auto& item: vis)
        for(auto& i: item) i = false;
    
    FOR(i, n)
    {
        FOR(j, m)
        {
            if(s[0] == a[i][j] && f(i, j, 0, s))
                return true;
        }
    }
    return dp[s] = false;
}

int solve()
{
    if(!(cin >> n >> m))
        return 1;
    a = vector<string>(n);
    FOR(i, n)
        cin >> a[i];
    int q;
    cin >> q;
    int ctr = 0;
    FOR(_, q)
    {
        string s;
        cin >> s;
        if(contains(s))
            ++ctr;
    }
    cout << ctr << '\n';
    return 0;
}

int32_t main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int TET = 1e9;
    //cin >> TET;
    for (int i = 1; i <= TET; i++)
    {
        if (solve())
        {
            break;
        }
#ifdef ONPC
        cout << "__________________________" << endl;
#endif
    }
#ifdef ONPC
    cerr << endl << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec" << endl;
#endif
}