시간 제한메모리 제한제출정답맞힌 사람정답 비율
2 초 512 MB0000.000%

## 문제

Boris really likes numbers and even owns a small shop selling interesting numbers. He has $n$ decimal numbers $B_i$. Cost of the number in his shop is equal to the sum of costs of its digits. Of course, Boris is interested in that numbers he owns have the maximum cost possible.

Recently Boris got hold of the magical artifact $A$, which can allow him to increase the cost of his collection. Artifact is a string, consisting of digits and '?' symbols. To use the artifact, Boris must replace all '?' with digits to get a decimal number without leading zeros (it is also not allowed to get number 0). After that, the resulting number is added to all numbers $B_i$ in Boris' collection. He uses the artifact exactly once.

What is the maximum cost of the collection Boris can achieve after using the artifact?

## 입력

First line contains artifact $A$, consisting of digits '0'--'9' and '?' symbols ($1 \le |A| \le 1000$). Next line contains $n$ --- the amount of numbers in Boris' collection ($1 \le n \le 1000$). Next $n$ lines contain integers $B_i$ ($1 \le B_i < 10^{1000}$). $A$ doesn't start with '0'.

Last line contains ten integers --- costs of digits $c_0, c_1, \ldots, c_9$ ($0 \le c_i \le 1000$).

## 출력

Output one integer --- the maximum possible cost of the collection after using the artifact.

## 서브태스크

번호배점제한
17

$n, |A| \le 15$, $B_i < 10^{15}$, $A$ doesn't contain '?'

215

$n, |A| \le 15$, $B_i < 10^{15}$, $A$ contains at most 3 '?'

335

$n \le 15$, $|A| \le 100$, $B_i < 10^{100}$

443

$n, |A| \le 1000$, $B_i < 10^{1000}$

## 예제 입력 1

42
3
89
1
958
0 0 1 1 2 2 3 3 4 4


## 예제 출력 1

4


## 예제 입력 2

?5?
4
2203
5229
276
6243
2 1 6 1 1 2 5 2 2 3


## 예제 출력 2

62


## 힌트

In the second sample input, the optimal way is to compose the number 453. After adding this number, Boris will have numbers 2656, 5682, 729 and 6696. The total cost of all digits in them is equal to $18 + 15 + 11 + 18 = 62$.

## 채점 및 기타 정보

• 예제는 채점하지 않는다.