Codeforces Round 362 (Div. 1) |
---|

Finished |

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

data structures

dp

matrices

strings

*2500

No tag edit access

The problem statement has recently been changed. View the changes.

×
D. Legen...

time limit per test

6 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputBarney 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 *a*_{i}. 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* ≤ 10^{14}) — the number of pickup lines and the maximum length of Barney's text.

The second line contains *n* integers *a*_{1}, *a*_{2}, ..., *a*_{n} (1 ≤ *a*_{i} ≤ 100), meaning that Nora's happiness level increases by *a*_{i} after every time seeing *i*-th pickup line.

The next *n* lines contain the pickup lines. *i*-th of them contains a single string *s*_{i} 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.

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/15/2024 10:59:01 (k3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|