#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const double eps = 1e-9;
const int inf = 2000000000;
const long long infLL = 9000000000000000000;
inline bool checkBit(long long n, int i) { return n & (1LL << i); }
inline long long setBit(long long n, int i) {
  return n | (1LL << i);
  ;
}
inline long long resetBit(long long n, int i) { return n & (~(1LL << i)); }
int dx[] = {0, 0, +1, -1};
int dy[] = {+1, -1, 0, 0};
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
inline bool isLeapYear(long long year) {
  return (year % 400 == 0) || (year % 4 == 0 && year % 100 != 0);
}
inline void normal(long long &a) {
  a %= 1000000007;
  (a < 0) && (a += 1000000007);
}
inline long long modMul(long long a, long long b) {
  a %= 1000000007, b %= 1000000007;
  normal(a), normal(b);
  return (a * b) % 1000000007;
}
inline long long modAdd(long long a, long long b) {
  a %= 1000000007, b %= 1000000007;
  normal(a), normal(b);
  return (a + b) % 1000000007;
}
inline long long modSub(long long a, long long b) {
  a %= 1000000007, b %= 1000000007;
  normal(a), normal(b);
  a -= b;
  normal(a);
  return a;
}
inline long long modPow(long long b, long long p) {
  long long r = 1;
  while (p) {
    if (p & 1) r = modMul(r, b);
    b = modMul(b, b);
    p >>= 1;
  }
  return r;
}
inline long long modInverse(long long a) { return modPow(a, 1000000007 - 2); }
inline long long modDiv(long long a, long long b) {
  return modMul(a, modInverse(b));
}
const int MX = 10100;
string s[MX * 10], so;
int n, vis[MX];
pair<int, int> par[MX];
vector<pair<int, int> > adjList[MX];
struct node {
  int endmark;
  node *next[26 + 1];
  node() {
    endmark = -1;
    for (int i = 0; i < 26; ++i) next[i] = NULL;
  }
} * root;
void insert(int idx) {
  string t = s[idx];
  reverse(t.begin(), t.end());
  for (int i = 0; i < t.size(); ++i) {
    if (isupper(t[i])) t[i] = tolower(t[i]);
  };
  node *cur = root;
  for (int i = 0; i < t.size(); ++i) {
    int id = t[i] - 'a';
    if (cur->next[id] == NULL) cur->next[id] = new node();
    cur = cur->next[id];
  }
  cur->endmark = idx;
}
void process(int idx) {
  node *cur = root;
  for (int i = idx; i < so.size(); ++i) {
    ;
    int id = so[i] - 'a';
    if (cur->next[id] == NULL) break;
    cur = cur->next[id];
    if (cur->endmark >= 0) {
      adjList[idx].emplace_back(pair<int, int>(i + 1, cur->endmark));
      ;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  root = new node();
  cin >> n;
  cin >> so;
  int m;
  cin >> m;
  for (int i = 0; i < m; ++i) {
    cin >> s[i];
    insert(i);
  }
  for (int i = 0; i < n; ++i) {
    process(i);
  }
  queue<int> bfs;
  bfs.push(0);
  vis[0] = true;
  while (!bfs.empty() && !vis[n]) {
    int u = bfs.front();
    bfs.pop();
    ;
    for (auto v : adjList[u]) {
      if (vis[v.first]) continue;
      vis[v.first] = true;
      par[v.first] = pair<int, int>(u, v.second);
      bfs.push(v.first);
    }
  }
  vector<int> ans;
  for (int i = n; i > 0; ans.emplace_back(par[i].second), i = par[i].first)
    ;
  for (int i = ans.size() - 1; i >= 0; --i) cout << s[ans[i]] << " ";
  return 0;
}
