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:
import java.util.*;
import java.io.*;
public class Solution implements Runnable{
    FastScanner sc;
    PrintWriter pw;
    final class FastScanner {
        BufferedReader br;
        StringTokenizer st;
 
        public FastScanner() {
            try {
                br = new BufferedReader(new InputStreamReader(System.in));
                st = new StringTokenizer(br.readLine());
            } catch (Exception e) {
                e.printStackTrace();
            }
        }
 
        public long nlo() {
            return Long.parseLong(next());
        }
 
        public String next() {
            if (st.hasMoreTokens()) return st.nextToken();
            try {
                st = new StringTokenizer(br.readLine());
            } catch (Exception e) {
                e.printStackTrace();
            }
            return st.nextToken();
        }
 
        public int ni() {
            return Integer.parseInt(next());
        }
 
        public String nli() {
            String line = "";
            if (st.hasMoreTokens()) line = st.nextToken();
            else try {
                return br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            while (st.hasMoreTokens()) line += " " + st.nextToken();
            return line;
        }
 
        public double nd() {
            return Double.parseDouble(next());
        }
    }
    public static void main(String[] args) throws Exception
    {
        new Thread(null,new Solution(),"codeforces",1<<28).start();
    }
    public void run()
    {
        sc=new FastScanner();
        pw=new PrintWriter(System.out);
        solve();
        pw.flush();
        pw.close();
    }
    public long gcd(long a,long b)
    {
        return b==0L?a:gcd(b,a%b);
    }
    public long ppow(long a,long b,long mod)
    {
        if(b==0L)
        return 1L;
        long tmp=1;
        while(b>1L)
        {
            if((b&1L)==1)
            tmp*=a;
            a*=a;
            a%=mod;
            tmp%=mod;
            b>>=1;
        }
        return (tmp*a)%mod;
    }
    public  int gcd(int x,int y)
    {
        return y==0?x:gcd(y,x%y);
    }
    //////////////////////////////////
    /////////////  LOGIC  ///////////
    ////////////////////////////////
    public long p,mod;
    long[] prr;
    public void solve()
    {
        int t=1;
        p=53;
        prr=new long[10001];
        prr[0]=1;
        mod=1000000007;
        for(int i=1;i<=10000;i++)
        prr[i]=(p*prr[i-1])%mod;
        while(t-->0)
        {
            int n=sc.ni();
            char[] arr=sc.next().toCharArray();
            HashSet<Long> set=new HashSet();
            HashMap<String,String> map=new HashMap();
            int m=sc.ni();
            while(m-->0)
            {
                String ss=sc.next();
                map.put(ss.toLowerCase(),ss);
                StringBuilder str=new StringBuilder(ss.toLowerCase());
                str.reverse();
                char[] brr=str.toString().toCharArray();
                long tmp=0;
                for(int i=0;i<brr.length;i++)
                {
                    tmp=tmp+((long)(brr[i]-'a')+1L)*prr[i];
                    tmp%=mod;
                }
                set.add(tmp);
            }
            boolean[] res=new boolean[n+1];
            res[n]=true;
            int[] ans=new int[n+1];
            Arrays.fill(ans,-1);
            ans[n]=n;
            for(int i=n-1;i>=0;i--)
            {
                long tmp=0;
                for(int j=i;j<n;j++)
                {
                    tmp=tmp+prr[j-i]*((long)(arr[j]-'a')+1L);
                    while(tmp>=mod)
                    tmp-=mod;
                    if((ans[j+1]!=-1)&&(set.contains(tmp)))
                    {
                        ans[i]=j+1;
                        break;
                    }
                }
            }
            StringBuilder mm=new StringBuilder();
            int i=0;
            int d=-1;
            while(ans[i]!=-1)
            {
                if(i==n)
                {
                    d=0;
                    break;
                }
                StringBuilder tm=new StringBuilder();
                for(int j=i;j<ans[i];j++)
                tm.append(arr[j]);
                String s=tm.reverse().toString();
                mm.append(map.get(s)+" ");
                i=ans[i];
            }
            if(d==0)
            pw.println(mm);
            else
            pw.println("-1");
        }
    }
}