You are given a string S which consists of only lower case letters and N keyword W1, W2, … WN which also consists of only lower case letters. For each appearance of a keyword in S you need to change the letters matching the keyword into ‘*‘.
Assume
= "abcxyzabcd"``` and keywords are {"abc", "cd"}, the filtered S' will be ```"***xyz****"```.
1
2
3
4
5
6
7
8
9
10
11
12
## Input
The first line contains an integer N. (1 <= N <= 1000)
The following N lines each contains a keyword. The total length of the keywords is no more than 100000.
The last line contains the string S. The length of S is no more than 100000.
近期评论