#include <bits/stdc++.h>

using namespace std;

typedef double ld;
typedef unsigned long ul;
// typedef long long ll;
typedef unsigned long long ll;
typedef pair<ll, ll> pll;

const int maxn = 3e6 + 50;
const int inf = 0x3f3f3f;
const ll mo998 = 998244353;

vector<bool> isprime;
vector<ll> primes;
void init_primes() {
  isprime.assign(maxn + 1, true);
  isprime[0] = isprime[1] = false;
  for (ll i = 2; i <= maxn; i++) {
    if (!isprime[i])
      continue;
    for (ll j = 2; i * j <= maxn; j++) {
      isprime[i * j] = false;
    }
  }
}

ll b = 131;
vector<ll> pb;
vector<ll> get_hash(string s) {
  ll n = s.size();
  vector<ll> v(n + 1);
  v[0] = 0;
  for (int i = 0; i < n; i++) {
    ll x = s[i] - 'a';
    v[i + 1] = (v[i] + pb[i] * x);
  }
  return v;
}

ll n, q, m, k;
ll check(vector<ll> v1, vector<ll> v2, ll lp) {
  // lp是上一个不同的位置
  ll l = lp + 1, r = m + 1; // [l,r]
  while (l < r) {
    ll mid = (l + r) / 2;
    if (v1[mid] - v1[lp] == v2[mid] - v2[lp]) {
      l = mid + 1;
    } else {
      r = mid;
    }
  }
  // 返回不同的那一位
  return l;
};

void solve() {
  cin >> n >> q >> m >> k;

  ll bb = 1;
  for (int i = 0; i <= m; i++) {
    pb.push_back(bb);
    bb *= b;
  }

  vector<vector<ll>> h1;
  string ss;
  for (int i = 0; i < n; i++) {
    cin >> ss;
    h1.push_back(get_hash(ss));
  }

  while (q--) {
    string s;
    cin >> s;
    if (k >= m) {
      cout << n << '\n';
      continue;
    }
    vector<ll> hs = get_hash(s);
    ll ans = 0;
    for (int i = 0; i < n; i++) {
      ll p = 0, cnt = 0;
      // ll ki = k;
      bool flag = true;
      while (p + 1 <= m) {
        p = check(hs, h1[i], p);
        if (p > m)
          break;
        cnt++;
        if (cnt == k && hs[m] - hs[p] == h1[i][m] - h1[i][p]) {
          break;
        }
        if (cnt > k) {
          flag = false;
          break;
        }
      }
      // cout << p << ' ';
      if (flag) {
        ans++;
      }
    }
    cout << ans << '\n';
  }
}

// void init() {
//   // init_primes();
//   ll m = 4;
//   auto check = [&](vector<ll> v1, vector<ll> v2, ll lp) {
//     // lp是上一个不同的位置
//     ll l = lp + 1, r = m + 1; // [l,r)
//     while (l < r) {
//       ll mid = (l + r) / 2;
//       if (v1[mid] - v1[lp] == v2[mid] - v2[lp]) {
//         l = mid + 1;
//       } else {
//         r = mid;
//       }
//     }
//     // 返回不同的那一位
//     return l;
//   };
//   cout << check({0, 1, 2, 3, 4}, {0, 1, 2, 3, 4}, 0) << '\n';
//   cout << check({0, 1, 2, 3, 4}, {0, 1, 2, 3, 5}, 0) << '\n';
//   cout << check({0, 1, 2, 3, 4}, {0, 1, 2, 4, 5}, 0) << '\n';
//   cout << check({0, 1, 2, 3, 4}, {0, 1, 3, 4, 5}, 0) << '\n';
//   cout << check({0, 1, 2, 3, 4}, {0, 2, 3, 4, 5}, 0) << '\n';
// }

int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  // init();
  int _t = 1;
  // cin >> _t;
  // cin.get();
  while (_t--)
    solve();

  return 0;
}