After observing the results of Spy Syndrome, Yash realised the errors of his ways. He now believes that a super spy such as Siddhant can't use a cipher as basic and ancient as Caesar cipher. After many weeks of observation of Siddhant’s sentences, Yash determined a new cipher technique.

For a given sentence, the cipher is processed as: 

  1. Convert all letters of the sentence to lowercase. 
  2. Reverse each of the words of the sentence individually. 
  3. Remove all the spaces in the sentence. 



For example, when this cipher is applied to the sentence

Kira is childish and he hates losing

the resulting string is

ariksihsidlihcdnaehsetahgnisol

Now Yash is given some ciphered string and a list of words. Help him to find out any original sentence composed using only words from the list. Note, that any of the given words could be used in the sentence multiple times.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 10 000) — the length of the ciphered text. The second line consists of n lowercase English letters — the ciphered text t.

The third line contains a single integer m (1 ≤ m ≤ 100 000) — the number of words which will be considered while deciphering the text. Each of the next m lines contains a non-empty word wi (|wi| ≤ 1 000) consisting of uppercase and lowercase English letters only. It's guaranteed that the total length of all words doesn't exceed 1 000 000.

Output

Print one line — the original sentence. It is guaranteed that at least one solution exists. If there are multiple solutions, you may output any of those.

Examples

Input

30
ariksihsidlihcdnaehsetahgnisol
10
Kira
hates
is
he
losing
death
childish
L
and
Note


Output

Kira is childish and he hates losing 


Input

12
iherehtolleh
5
HI
Ho
there
HeLLo
hello


Output

HI there HeLLo 

Note

In sample case 2 there may be multiple accepted outputs, "HI there HeLLo" and "HI there hello" you may output any of them. 
#include <bits/stdc++.h>
typedef struct {
  char *key;
  char *val;
  void *next;
} t_hashnode;
t_hashnode *hash_tab[205000];
int str_stack_size[2];
char *str_stack[2][10000];
int len_line, num_words;
int str_len(char *in);
void str_cpy(char *in0, char *in1, int len);
int check_words();
int process_fail();
void push_stack(char *str, int stack_num) {
  if (str_stack_size[stack_num] < 10000) {
    int len = str_len(str);
    str_stack[stack_num][str_stack_size[stack_num]] = new char[len + 1];
    str_cpy(str, str_stack[stack_num][str_stack_size[stack_num]++], len);
  }
}
void pop_stack(char *str, int stack_num) {
  if (str_stack_size[stack_num] > 0) {
    str = str_stack[stack_num][--str_stack_size[stack_num]];
    delete str_stack[stack_num][str_stack_size[stack_num]];
  }
}
void init() {
  for (int i = 0; i < 205000; i++) {
    hash_tab[i] = NULL;
  }
}
int str_len(char *in) {
  int len = 0;
  char *p_in = in;
  while (*p_in++ != '\0') len++;
  return len;
}
int str_cmp(char *in0, char *in1, int len) {
  if (0 == len) {
    while (*in0 == *in1) {
      if (*in0 == '\0' && *in1 == '\0') return true;
      in0++;
      in1++;
    }
    return false;
  } else {
    int i = 0;
    while (*in0++ == *in1++) {
      if (len - 1 == i++) return true;
    }
    return false;
  }
}
void str_cpy(char *in0, char *in1, int len) {
  if (len != 0) {
    for (int i = 0; i < len; i++) {
      *in1++ = *in0++;
    }
    *in1 = '\0';
  } else {
    do {
      *in1++ = *in0;
    } while ('\0' != *in0++);
  }
}
int is_substr(char *str0, char *str1) {
  int len = str_len(str0);
  for (int i = 0; i < len; i++) {
    if (str0[i] != str1[i]) return false;
  }
  if (('\0' == str0[len]) && ('\0' != str1[len]))
    return true;
  else
    return false;
}
void lower_reverse(char *in, char *out) {
  int len;
  len = str_len(in);
  for (int i = 0; i < len; i++) {
    char bar = in[len - 1 - i];
    bar = (bar < 97) ? bar + 32 : bar;
    out[i] = bar;
  }
  out[len] = '\0';
  return;
}
int str_hash(char *str, int len) {
  unsigned int hash_ = 1315423911;
  len = (0 == len) ? str_len(str) : len;
  for (int i = 0; i < len; i++) {
    hash_ ^= ((hash_ << 5) + str[i] + (hash_ >> 2));
  }
  return (hash_ % 205000);
}
void set_value(t_hashnode *node, char *val) { node->val = val; }
int get_value(t_hashnode *node, char *val) {
  val = node->val;
  return 0;
}
int get_key(t_hashnode *node, char *key) {
  key = node->key;
  return 0;
}
void set_next(t_hashnode *node, t_hashnode *next) { node->next = next; }
t_hashnode *get_next(t_hashnode *node) { return (t_hashnode *)node->next; }
char *get_hash_table(char *key, int len) {
  char key_line[1001];
  str_cpy(key, key_line, len);
  int hash_val = str_hash(key_line, 0);
  t_hashnode *node = hash_tab[hash_val];
  while (node != NULL) {
    if (str_cmp(node->key, key_line, 0)) {
      return node->val;
    }
    node = get_next(node);
  }
  return NULL;
}
void put_hash_table(char *key, char *val) {
  if (str_len(key) != str_len(val)) {
    printf("Not equal: %d %d %s %s", str_len(key), str_len(val), key, val);
  }
  int hash_val = str_hash(key, 0);
  t_hashnode *prev = NULL;
  t_hashnode *node = hash_tab[hash_val];
  while (node != NULL && !str_cmp(node->key, key, 0)) {
    prev = node;
    node = get_next(node);
  }
  int len = str_len(key);
  char *node_val = new char[len + 1];
  str_cpy(val, node_val, 0);
  if (NULL != node) {
    delete node->val;
    node->val = node_val;
  } else {
    t_hashnode *node_add = new t_hashnode;
    char *node_key = new char[len + 1];
    str_cpy(key, node_key, 0);
    node_add->key = node_key;
    node_add->val = node_val;
    node_add->next = NULL;
    if (prev == NULL) {
      hash_tab[hash_val] = node_add;
    } else {
      prev->next = node_add;
    }
  }
  return;
}
int process_line(char *line, int idx) {
  if (len_line == idx) {
    for (int i = 0; i < str_stack_size[0]; i++) {
      printf("%s ", str_stack[0][i]);
    }
    return true;
  }
  int size_i = 1;
  do {
    char *bar = NULL;
    int res;
    int i;
    for (i = size_i; i <= 1000; i++) {
      if ((idx + i) > len_line) {
        break;
      }
      bar = get_hash_table(line + idx, i);
      if (NULL != bar) {
        break;
      }
    }
    if (NULL != bar) {
      char foo[100];
      sprintf(foo, "1 %d %d %d %d", idx, i, size_i, str_len(bar));
      push_stack(foo, 1);
      push_stack(bar, 0);
      res = process_line(line, idx + i);
      if (res) {
        return res;
      } else {
        sprintf(foo, "2 %d %d %d ", idx, i, size_i);
        push_stack(foo, 1);
        pop_stack(bar, 0);
        size_i = i + 1;
      }
    } else {
      char foo[100];
      sprintf(foo, "3 %d %d %d ", idx, i, size_i);
      push_stack(foo, 1);
      return false;
    }
  } while (true);
}
int process_fail() {
  char *foo =
      "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
      "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
      "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
      "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
      "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaecaedcddaeadebdbaddbdecaea"
      "cccdeedabdbdadabbcdabddbabdbbacbcbeaaabeedbbecacecbcdbceccaecdeacddddaee"
      "ddeebebaeddbbacededbdbdecedabdbaceedddeeaecccbcacddaadeaaaccdbaeddaebcea"
      "acacaca";
  if (is_substr(foo, str_stack[0][0])) {
    printf("Failed ");
    int sum = 0;
    for (int i = 0; i < str_stack_size[0]; i++) {
      sum += str_len(str_stack[0][i]);
      printf("%d ", str_len(str_stack[0][i]));
    }
    printf("%d %d ", str_stack_size[0], sum);
    printf("debug stack: ");
    for (int i = 0; i < str_stack_size[1]; i++) {
      printf("%s ", str_stack[1][i]);
    }
  }
  return false;
}
int main(int argc, char **argv) {
  init();
  char line_cyphered[10001];
  char word_in[1001], word_reversed[1001];
  scanf("%d", &len_line);
  scanf("%s", line_cyphered);
  scanf("%d", &num_words);
  for (int i = 0; i < num_words; i++) {
    scanf("%s", word_in);
    lower_reverse(word_in, word_reversed);
    put_hash_table(word_reversed, word_in);
  }
  process_line(line_cyphered, 0);
  return 0;
}
