#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
string s[maxn];
int t[maxn * 10][26], c = 1;
int v[maxn * 10];
int ret[maxn], size = 0;
int cid(char ch) {
  if (isupper(ch)) return ch - 'A';
  return ch - 'a';
}
void add(int id) {
  int u = 0, l;
  char str[1005];
  strcpy(str, s[id].c_str());
  l = strlen(str);
  for (int i = 0; i < l; i++) {
    if (!t[u][cid(str[i])]) t[u][cid(str[i])] = c++;
    u = t[u][cid(str[i])];
  }
  v[u] = id;
}
void get(char s1[]) {
  size = 0;
  int l = strlen(s1), u = 0;
  for (int i = 0; i < l; i++) {
    if (!t[u][cid(s1[i])]) break;
    u = t[u][cid(s1[i])];
    if (v[u]) ret[size++] = v[u];
  }
}
int n, m;
char p[10005], tmp[10005];
int dp[10005];
int f[10005];
int main() {
  cin >> n;
  scanf("%s", p + 1);
  cin >> m;
  for (int i = 1; i <= m; i++) {
    scanf("%s", tmp);
    s[i] = tmp;
    add(i);
  }
  dp[0] = 1;
  tmp[0] = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = i; j > 0; j--) {
      tmp[i - j] = p[j];
    }
    tmp[i] = 0;
    get(tmp);
    for (int j = 0; j < size; j++) {
      if (dp[i - s[ret[j]].size()]) {
        dp[i] = ret[j];
        f[i] = i - s[ret[j]].size();
        break;
      }
    }
  }
  stack<int> S;
  for (int j = n; j > 0; j = f[j]) {
    S.push(j);
  }
  while (!S.empty()) {
    int u = S.top();
    S.pop();
    printf("%s ", s[dp[u]].c_str());
  }
  return 0;
}
