Problem: 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. 

Solution (in JAVA):

Solution:
// CodeForces Round #633 C competition

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Map;
import java.util.TreeMap;

public class SindromShpiona {
	
	class TNode {
		String a; // if not null we have this string
		TNode []chld = new TNode[26];  // number of chars in alphabet
		int level;   // 0 for root node
		
		void addWord(String aa, String ba) {
			// adding by b
			int ln = ba.length();
			if (ln < level) {
				System.out.println("Bad addition for " + ba);
				return;
			} else if (ln==level) {
				if (a==null) {
					a = aa;					
				}
			} else {
				char c = ba.charAt(level);
				int idx = (int)(c-'a');
				if (chld[idx]==null) {
					TNode h = new TNode();
					h.level = level+1;
					chld[idx] = h;
				}
				TNode ch = chld[idx];
				ch.addWord(aa, ba);				
			}			
		}
	}	
	
	class Sentence {
		Sentence prev;
		String w;
		
		Sentence() {
			prev=null; w=null;
		}
		
		Sentence(Sentence b, String wa) {
			prev = b;
			w = wa;
		}
		
		void print() {
			List<String> lw = new ArrayList<>();
			Sentence cu = this;
			while (cu != null) {
				lw.add(cu.w);
				cu = cu.prev;
			}
			for (int i=lw.size()-2; i>=0; i--) {
				if (i<lw.size()-2) {
					System.out.print(" ");
				}
				System.out.print(lw.get(i));
			}
			System.out.println();
		}
	}
	
	int n,m;
	int k;
	String a;
	List<Integer> la = new ArrayList<>();
	TNode dictRoot;
	Sentence res = null;
		// TODO Auto-generated method stub
	
	String reverse(String a) {
		StringBuilder sb = new StringBuilder();
		for (int i=a.length()-1; i>=0; i--) {
			char c = a.charAt(i);
			sb.append(Character.toLowerCase(c));				
		}
		String b = "" + sb;
		return b;
	}
	
	private void readData(BufferedReader bin) throws IOException {
		String s = bin.readLine();
		String []ss = s.split(" ");
		n = Integer.parseInt(ss[0]);
		a = bin.readLine();
		s = bin.readLine();
		ss = s.split(" ");
		m = Integer.parseInt(ss[0]);
		dictRoot = new TNode();
		for (int i=0; i<m; i++) {
			s = bin.readLine();
			String sr = reverse(s);
			dictRoot.addWord(s, sr);
		}
	}
	
	void printRes() {
		res.print();
	}
	
	private void calculate() {
		Sentence []sa = new Sentence[n+1];
		// add empty sentence
		sa[0] = new Sentence();
		for (int i=0; i<n; i++) {
			// adding to sentences
			if (sa[i]==null) {
				continue;
			}
			Sentence o = sa[i];
			// look for all words starting in a
			TNode tn = dictRoot;
			for (int j=0; (i+j)<a.length(); j++){
				int idx = (int)(a.charAt(i+j) - 'a');
				if (tn.chld[idx] != null) {
					tn = tn.chld[idx];
					if (tn.a != null && sa[i+j+1]==null) {
						Sentence s = new Sentence(o,tn.a);
						sa[i+j+1] = s;
					}
				} else {
					break;
				}
			}				
		}
		res = sa[n];
	}

	public static void main(String[] args) throws IOException {
		// BufferedReader bin = new BufferedReader(new FileReader("cactus.in"));
		BufferedReader bin = new BufferedReader(new InputStreamReader(System.in));
		SindromShpiona dr = new SindromShpiona();
		dr.readData(bin);
		dr.calculate();
		dr.printRes();
	}
}