Niki in Digikala's Fraud Detection department is looking for similar names for an unknown reason. Instead of using probabilistic models, he tries to measure the similarity of two nouns with a strange method. Nicky puts a number of hyphens (-) inside both strings, from zero to infinity, to make the two strings equal in length (the final length of the two strings can grow to infinity). These dashes can be at the beginning, end, between the letters of the words, and several dashes can be placed together. Then he puts the two obtained strings next to each other and compares them letter by letter and considers the similarity of the two names equal to the sum of the points of the letters being placed together. The score of placing letters next to each other is calculated with the following rules:

If two dashes are placed next to each other, they will be given a minus 5 score

If a letter is placed next to a dashed line, they will be given a minus 5 score

If two letters are placed next to each other, their score is calculated from the following proximity matrix. Each number in this matrix shows the proximity of the letter corresponding to the row and column of that number. This matrix does not include some letters, because these letters do not exist in the names that reach Niki.

 A C D E F G H I K L M N P Q R S T V W Y
Plain text
A 4 0 -2 -1 -2 0 -2 -1 -1 -1 -1 -2 -1 -1 -1 1 0 0 -3 -2 C 0 9 -3 -4 -2 -3 -3 -1 -3 -1 -1 -3 -3 -3 -3 -1 -1 -1 -2 -2 D -2 -3 6 2 -3 -1 -1 -3 -1 -4 -3 1 -1 0 - 2 0 -1 -3 -4 -3 E -1 -4 2 5 -3 -2 0 -3 1 -3 -2 0 -1 2 0 0 -1 -2 -3 -2 F -2 -2 -3 -3 6 -3 -1 0 -3 0 0 -3 -4 -3 -3 -2 -2 -1 1 3 G 0 -3 -1 -2 -3 6 -2 -4 -2 -4 -3 0 -2 -2 -2 0 -2 -3 -2 -3 H -2 -3 -1 0 -1 -2 8 -3 -1 -3 -2 1 -2 0 0 -1 -2 -3 -2 2 I -1 -1 -3 -3 0 -4 -3 4 -3 2 1 -3 -3 -3 -3 -2 -1 3 -3 -1 K -1 -3 -1 1 -3 -2 -1 -3 5 -2 -1 0 -1 1 2 0 -1 -2 -3 -2 L -1 -1 -4 -3 0 -4 -3 2 -2 4 2 -3 -3 -2 -2 -2 -1 1 -2 -1 M -1 -1 -3 -2 0 -3 -2 1 -1 2 5 -2 -2 0 -1 -1 -1 1 -1 -1 N -2 -3 1 0 - 3 0 1 -3 0 -3 -2 6 -2 0 0 1 0 -3 -4 -2 P -1 -3 -1 -1 -4 -2 -2 -3 -1 -3 -2 -2 7 - 1 -2 -1 -1 -2 -4 -3 Q -1 -3 0 2 -3 -2 0 -3 1 -2 0 0 -1 5 1 0 -1 -2 -2 -1 R -1 -3 -2 0 -3 -2 0 -3 2 -2 -1 0 -2 1 5 -1 -1 -3 -3 -2 S 1 -1 0 0 -2 0 -1 -2 0 -2 -1 1 - 1 0 -1 4 1 -2 -3 -2 T 0 -1 -1 -1 -2 -2 -2 -1 -1 -1 -1 0 -1 -1 -1 1 5 0 -2 -2 V 0 -1 -3 -2 -1 -3 -3 3 -2 1 1 -3 -2 -2 -3 -2 0 4 -3 -1 W -3 -2 -4 -3 1 -2 -2 -3 - 3 -2 -1 -4 -4 -2 -3 -3 -2 -3 11 2 Y -2 -2 -3 -2 3 -3 2 -1 -2 -1 -1 -2 -3 -1 -2 -2 -2 -1 2 7

Obviously, there are an infinite number of ways to include hyphens in strings. You should print the maximum score of two strings together in the output.

input
The input consists of two lines, each line contains a string. The letters of this string are only from the letters inside the matrix and in capital letters. For example, the characters B or a do not exist in the input string.
0
<
l
e
n
g
t
h
(
s
t
r
1
)
,
l
e
n
g
t
h
(
s
t
r
2
)
<
1

000
0<length(str1),length(str2)<1000

output
The output is an integer that represents the maximum score of the letter combination.

Example
Sample entry 1
A
A.D
Plain text
Sample output 1
-1
Plain text
In this example, the most optimal case is when a hyphen is added to the end of the first string. Therefore, the proximity of the letter A from the first string and the letter A from the second string receives 4 points, and the proximity of the bold line from the first string and the letter D from the second string receives -5 points, and the maximum similarity score of these two strings is equal to the sum of these numbers, i.e. -1.

Sample input 2
PLEASANTLY
MEANLY
Plain text
Sample output 2
8
Plain text
In this example, the highest score is when the letters are placed together as follows:

PLEASANTLY
-MEA--N-LY
Plain text
In this example, the letter P from the first string is in front of the dash from the second string and gets a score of -5. Then the letter L from the first string and the letter M from the second string are placed together and get a score of 2. So the total score so far is -3. It continues in the same way. write in c++