#include <bits/stdc++.h>
using namespace std;
int dp[10010], wh[10010], n, t[1000010][26], en[1000010], id = 1;
string s;
void add(string &s, int idd) {
  int now = 0;
  for (auto x : s) {
    if (t[now][x - 'a'] < 0) t[now][x - 'a'] = id++;
    now = t[now][x - 'a'];
  }
  en[now] = idd;
}
void get(string &s) {
  reverse(s.begin(), s.end());
  for (int i = 0, ggdem = ((int)(s).size()); i < ggdem; i++)
    if (s[i] >= 'A' && s[i] <= 'Z') s[i] += 'a' - 'A';
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  memset(t, -1, sizeof(t));
  memset(en, -1, sizeof(en));
  memset(wh, -1, sizeof(wh));
  cin >> n >> s;
  int m;
  cin >> m;
  vector<string> vs(m), real(m);
  for (int i = 0, ggdem = m; i < ggdem; i++)
    cin >> vs[i], real[i] = vs[i], get(vs[i]), add(vs[i], i);
  dp[n] = 1;
  for (int i = n - 1; i >= 0; i--) {
    int now = 0;
    for (int j = i, ggdem = min(n, i + 1010); j < ggdem; j++) {
      now = t[now][s[j] - 'a'];
      if (now < 0) break;
      if (en[now] >= 0 && dp[j + 1]) {
        dp[i] = 1;
        wh[i] = en[now];
        break;
      }
    }
  }
  vector<string> ans;
  int pos = 0;
  while (pos < n)
    ans.push_back(real[wh[pos]]), pos += ((int)(vs[wh[pos]]).size());
  for (int i = 0, ggdem = ((int)(ans).size()); i < ggdem; i++) {
    if (i) cout << " ";
    cout << ans[i];
  }
  cout << "\n";
}
