#include <bits/stdc++.h>
using namespace std;
template <class T, class T2>
inline bool chkmax(T &x, const T2 &y) {
  return x < y ? x = y, 1 : 0;
}
template <class T, class T2>
inline bool chkmin(T &x, const T2 &y) {
  return x > y ? x = y, 1 : 0;
}
const long long mod = 1e9 + 7;
template <class T>
inline void fix(T &x) {
  if (x >= mod | x <= -mod) {
    x %= mod;
  }
  if (x < 0) {
    x += mod;
  }
}
const int MAX_N = 1e6 + 10;
string in[MAX_N], st;
unsigned long long pw[MAX_N], h[MAX_N];
map<unsigned long long, int> ind;
bool ok[MAX_N];
int hist[MAX_N];
void output(int x) {
  if (x == 0) {
    return;
  }
  output(x - in[hist[x]].size());
  cout << in[hist[x]] << " ";
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  pw[0] = 1;
  for (int i = 1; i < MAX_N; i++) {
    pw[i] = pw[i - 1] * (unsigned long long)31;
  }
  int n;
  cin >> n >> st;
  int m;
  cin >> m;
  int mx = 0;
  for (int i = 0; i < m; i++) {
    cin >> in[i];
    chkmax(mx, in[i].size());
    for (int j = 0; j < in[i].size(); j++) {
      char cpy;
      if (in[i][j] >= 'A' && in[i][j] <= 'Z') {
        cpy = 'a' + in[i][j] - 'A';
      } else {
        cpy = in[i][j];
      }
      h[i] += pw[j] * (unsigned long long)(cpy - 'a' + 1);
    }
    ind[h[i]] = i;
  }
  st = '&' + st;
  ok[0] = true;
  for (int i = 1; i <= n; i++) {
    unsigned long long curr = 0;
    for (int offset = 1; i - offset >= 0 && offset <= mx; offset++) {
      curr += pw[offset - 1] * (st[i - offset + 1] - 'a' + 1);
      if (ind.find(curr) != ind.end() && ok[i - offset]) {
        ok[i] = true;
        hist[i] = ind[curr];
      }
    }
  }
  output(n);
  return 0;
}
