#include <bits/stdc++.h>
#include <cstdio>

using namespace std;

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

const int maxn = 3e6 + 50;
const int inf = 0x3f3f3f;
const ll mo998 = 998244353;
const ull mod1 = 212370440130137957, mod2 = 1e9 + 7;

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;
    }
  }
}

ull b1 = 131, b2 = 233;
vector<ull> pb1, pb2;
pair<vector<ull>, vector<ull>> get_hash(string s) {
  ll n = s.size();
  vector<ull> v(n + 1), w(n + 1);
  v[0] = 0, w[0] = 0;
  for (int i = 0; i < n; i++) {
    ll x = s[i] - 'a';
    v[i + 1] = (v[i] * b1 + x) % mod1;
    w[i + 1] = (w[i] * b2 + x) % mod2;
  }
  return {v, w};
}

ll n, q, m, k;
ll check(pair<vector<ull>, vector<ull>> v1, pair<vector<ull>, vector<ull>> v2,
         ll lp) {
  if ((v1.first[m] - v1.first[lp] * pb1[m - lp] + mod1) % mod1 ==
          (v2.first[m] - v2.first[lp] * pb1[m - lp] + mod1) % mod1 &&
      (v1.second[m] - v1.second[lp] * pb2[m - lp] + mod2) % mod2 ==
          (v2.second[m] - v2.second[lp] * pb2[m - lp] + mod2) % mod2) {
    return -1;
  }
  // lp是上一个不同的位置
  ll l = lp + 1, r = m + 1; // [l,r]
  while (l < r) {
    ll mid = (l + r) / 2;
    bool f1 = (v1.first[mid] - v1.first[lp] * pb1[mid - lp] + mod1) % mod1 ==
              (v2.first[mid] - v2.first[lp] * pb1[mid - lp] + mod1) % mod1;
    bool f2 = (v1.second[mid] - v1.second[lp] * pb2[mid - lp] + mod2) % mod2 ==
              (v2.second[mid] - v2.second[lp] * pb2[mid - lp] + mod2) % mod2;
    if (f1 && f2) {
      l = mid + 1;
    } else {
      r = mid;
    }
  }
  // 返回不同的那一位
  return l;
};

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

  ull bb1 = 1, bb2 = 1;
  pb1.assign(m + 6, 0);
  pb2.assign(m + 6, 0);
  for (int i = 0; i <= m + 5; i++) {
    pb1[i] = bb1;
    bb1 *= b1;
    pb2[i] = bb2;
    bb2 *= b2;
  }

  vector<pair<vector<ull>, vector<ull>>> h1;
  string ss;
  // vector<string> sv;
  for (int i = 0; i < n; i++) {
    cin >> ss;
    // sv.push_back(ss);
    h1.push_back(get_hash(ss));
  }

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

void init() {}

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

  return 0;
}