#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return f * x;
}
int n, m;
char ch[1010];
char a[10005];
const unsigned long long base = 233;
map<unsigned long long, string> mp;
unsigned long long f[10005];
int main() {
  n = read();
  scanf("%s", a + 1);
  m = read();
  for (int i = 1; i <= m; i++) {
    scanf("%s", ch + 1);
    int len = strlen(ch + 1);
    string tmp = "";
    for (int j = 1; j <= len; j++) tmp += ch[j];
    unsigned long long Hash = 0;
    for (int j = len; j > 0; j--) Hash = Hash * base + tolower(ch[j]) - 'a' + 1;
    mp[Hash] = tmp;
  }
  f[n + 1] = 1;
  for (int i = n; i >= 1; i--) {
    unsigned long long tmp = 0;
    for (int j = 1; j <= 1000 && i + j - 1 <= n; j++) {
      tmp = tmp * base + a[i + j - 1] - 'a' + 1;
      if (mp.count(tmp) && f[i + j]) {
        f[i] = tmp;
        break;
      }
    }
  }
  for (int i = 1; i <= n; i += mp[f[i]].length()) cout << mp[f[i]] << ' ';
  return 0;
}
