4655: Legen
内存限制：256 MB
时间限制：2 S
题面：传统
评测方式：文本比较
上传者：
提交：3
通过：1
题目描述
D. Legen...
time limit per test
6 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
Barney was hanging out with Nora for a while and now he thinks he may have feelings for her. Barney wants to send her a cheesy text message and wants to make her as happy as possible.
Initially, happiness level of Nora is 0. Nora loves some pickup lines like "I'm falling for you" and stuff. Totally, she knows n pickup lines, each consisting only of lowercase English letters, also some of them may be equal (in writing, but different in pronouncing or meaning though). Every time Nora sees i-th pickup line as a consecutive subsequence of Barney's text message her happiness level increases by ai. These substrings may overlap, for example, Nora will see the pickup line aa twice and the pickup line ab once in text message aaab.
Due to texting app limits, Barney's text may have up to l characters.
Barney asked you to help him make Nora as much happy as possible, it's gonna be legen...
Initially, happiness level of Nora is 0. Nora loves some pickup lines like "I'm falling for you" and stuff. Totally, she knows n pickup lines, each consisting only of lowercase English letters, also some of them may be equal (in writing, but different in pronouncing or meaning though). Every time Nora sees i-th pickup line as a consecutive subsequence of Barney's text message her happiness level increases by ai. These substrings may overlap, for example, Nora will see the pickup line aa twice and the pickup line ab once in text message aaab. Due to texting app limits, Barney's text may have up to l characters.
Barney asked you to help him make Nora as much happy as possible, it's gonna be legen...
Input
The first line of input contains two integers n and l (1≤n≤200,1≤l≤1014)− the number of pickup lines and the maximum length of Barney's text. The second line contains n integers a1,a2,...,an (1≤ai≤100), meaning that Nora's happiness level increases by ai after every time seeing i-th pickup line.
The next n lines contain the pickup lines. i-th of them contains a single string si consisting of only English lowercase letter. Summary length of all pickup lines does not exceed 200.
All strings are not empty.
Output
Print the only integer− the maximum possible value of Nora's happiness level after reading Barney's text.
Examples
Input
3 6 3 2 1 heart earth art
Output
6
Input
3 6 3 2 8 heart earth art
Output
16
Note
An optimal answer for the first sample case is hearth containing each pickup line exactly once. An optimal answer for the second sample case is artart.
输入样例 复制
输出样例 复制