Spy Syndrome 2 CodeForces - 633C

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 w_i (|w_i| ≤ 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 

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using namespace std;

const int maxn=1e6+10;

int next[maxn][26],end[maxn],word[maxn];
int cnt,rt;
string s[maxn],str;
int vis[maxn];
/*
发现这个字典树很神奇啊，之前只是找到有没有，现在和我们要位置
这个用数组模拟的也挺好的 
*/ 
int newnode(){
	for(int i=0;i<26;i++){
		next[cnt][i]=-1;
	}
	word[cnt]=0,end[cnt]=-1;
	return cnt++;//
} 

void init(int n){
	cnt=0;
	rt=newnode();
	fill(vis,vis+n+1,-1);
}

void insert(int id,string s){
	int u=rt;
	for(int i=0;i<s.length();i++){
		char ch=tolower(s[i]);
		int v=ch-'a';
		if(next[u][v]==-1){
			next[u][v]=newnode();
		}
		u=next[u][v];
		word[u]++;
	}	
	end[u]=id;
}
/*
不记录的话，我们会走很多重复的路，导致超时 
*/
bool dfs(int pos){
	if(pos==-1)
		return true;
	if(vis[pos]!=-1) return vis[pos];
	int u=rt;//找到字典的开头,也就是每个单词的开头看看是不是可以有这个单词 
	for(int i=pos;i>=0;i--){
		u=next[u][str[i]-'a'];
		if(u==-1) break;//如果下面没有字符了，就是非法访问了 
		int id=end[u];
		if(id!=-1&&dfs(i-1)){
			if(i==0) cout<<s[id];
			else cout<<" "<<s[id];
			return vis[pos]=true;
		} 
	}
	return vis[pos]=false; 
}

int main(){
	int n,m;
	cin>>n;
	cin>>str;
	cin>>m;
	init(n);
	for(int i=0;i<m;i++){
		cin>>s[i];
		insert(i,s[i]);
	}
	dfs(n-1);
	printf("\n");
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using namespace std;

const int maxn=1e6+10;

int cnt,rt;
string s[maxn],str;
int vis[maxn];

struct Tree{
	int pos;
	Tree* sub[26];
	Tree(){
		for(int i=0;i<26;i++) sub[i]=NULL;
		pos=-1;
	}
}; 

void init(int n){
	fill(vis,vis+n+1,-1);
} 

/*
很好用的东西，引用，这样的话，我们就可以直接从null变成一个有效地址 
*/
void newnode(Tree* & p){
	p=new Tree();
}

void insert(int id,string s,Tree* rt){
	Tree* p=rt;
	for(int i=0;i<s.length();i++){
		int pos=tolower(s[i])-'a';
		if(p->sub[pos]==NULL){
			newnode(p->sub[pos]);
		}
		p=p->sub[pos];
	}	
	p->pos=id;
}
/*
不记录的话，我们会走很多重复的路，导致超时 
*/
int dfs(Tree* rt,int pos){
	if(pos==-1)
		return 1;
	if(vis[pos]!=-1) return vis[pos];
	Tree* p=rt;//找到字典的开头,也就是每个单词的开头看看是不是可以有这个单词 
	for(int i=pos;i>=0;i--){
		p=p->sub[str[i]-'a'];
		if(p==NULL) break;//千万注意非法访问 
		int id=p->pos;
		if(id!=-1&&dfs(rt,i-1)){
			if(i==0) cout<<s[id];
			else cout<<" "<<s[id];
			return vis[pos]=1;
		} 
	}
	return vis[pos]=0; 
}

int main(){
	int n,m;
	cin>>n;
	cin>>str;
	cin>>m;
	Tree* rt;
	newnode(rt);
	init(n);
	for(int i=0;i<m;i++){
		cin>>s[i];
		insert(i,s[i],rt);
	}
	dfs(rt,n-1);
	printf("\n");
	return 0;
}