You are given a string $s$ of length $n$ consisting of lowercase English letters. This string can be used to build other strings. The cost of each letter in $s$ is given by another string $c$ of length $n$ consisting of digits, such that the cost of using the letter $s_i$ is $c_i$ coins.
Also, you are given another string $p$ of length $m$ consisting of *unique* lowercase English letters. Your task is to find the minimum cost to build string $p$ by using the letters of $s$. Can you?
The first line contains an integer $T$ ($1 <= T <= 500$) specifying the number of test cases.
The first line of each test case contains two integers $n$ and $m$ ($1 <= n <= 10^3, thin 1 <= m <= 26$), in which $n$ is the length of strings $s$ and $c$, and $m$ is the length of string $p$.
Then $3$ lines follow, each line contains a string, giving the string $s$, $c$, and $p$, respectively. Both strings $s$ and $p$ contains only lowercase English letters, while string $c$ contains only digits. Also, string $p$ is consisting of *unique* letters.
For each test case, print a single line containing the minimum cost of building the string $p$ by using the letters of string $s$. If string $p$ cannot be built using string $s$, print $-1$.
In the first test case, you have to use the $1^(s t)$ and $3^(r d)$ letters of string $s$ to build string $p$. So, the total cost is $1 + 3 = 4$.
In the second test case, you cannot build string $p$ using $s$ because the letter '_e_' from $p$ does not exist in $s$. So, the answer is $-1$.
In the third test case, the optimal way is to use the $1^(s t)$, $3^(r d)$, and $4^(t h)$ letters of string $s$ to build $p$. So, the total cost is $2 + 5 + 1 = 8$.
## Input
The first line contains an integer $T$ ($1 <= T <= 500$) specifying the number of test cases.The first line of each test case contains two integers $n$ and $m$ ($1 <= n <= 10^3, thin 1 <= m <= 26$), in which $n$ is the length of strings $s$ and $c$, and $m$ is the length of string $p$.Then $3$ lines follow, each line contains a string, giving the string $s$, $c$, and $p$, respectively. Both strings $s$ and $p$ contains only lowercase English letters, while string $c$ contains only digits. Also, string $p$ is consisting of *unique* letters.
## Output
For each test case, print a single line containing the minimum cost of building the string $p$ by using the letters of string $s$. If string $p$ cannot be built using string $s$, print $-1$.
[samples]
## Note
In the first test case, you have to use the $1^(s t)$ and $3^(r d)$ letters of string $s$ to build string $p$. So, the total cost is $1 + 3 = 4$.In the second test case, you cannot build string $p$ using $s$ because the letter '_e_' from $p$ does not exist in $s$. So, the answer is $-1$.In the third test case, the optimal way is to use the $1^(s t)$, $3^(r d)$, and $4^(t h)$ letters of string $s$ to build $p$. So, the total cost is $2 + 5 + 1 = 8$.
**Definitions**
Let $ T \in \mathbb{Z} $ be the number of test cases.
For each test case:
- Let $ n, m \in \mathbb{Z} $ denote the lengths of strings $ s $, $ c $ and $ p $, respectively.
- Let $ s = (s_1, s_2, \dots, s_n) $ be a string of lowercase English letters.
- Let $ c = (c_1, c_2, \dots, c_n) $ be a string of digits, where $ c_i \in \{0,1,\dots,9\} $ represents the cost of letter $ s_i $.
- Let $ p = (p_1, p_2, \dots, p_m) $ be a string of $ m $ unique lowercase English letters.
**Constraints**
1. $ 1 \le T \le 500 $
2. $ 1 \le n \le 10^3 $, $ 1 \le m \le 26 $
3. $ s_i \in \{a,b,\dots,z\} $, $ c_i \in \{0,1,\dots,9\} $, $ p_j \in \{a,b,\dots,z\} $
4. All characters in $ p $ are distinct.
**Objective**
For each test case, compute the minimum total cost to construct $ p $ using letters from $ s $, where:
- Each occurrence of a letter $ p_j $ in $ s $ can be used at cost $ c_i $ if $ s_i = p_j $.
- Each letter in $ p $ must be matched to exactly one occurrence in $ s $.
- If any letter in $ p $ does not appear in $ s $, return $ -1 $.
Define for each letter $ \ell \in p $:
$$
\text{cost}(\ell) = \min \{ c_i \mid s_i = \ell \}
$$
If $ \exists \ell \in p $ such that $ \ell \notin \{s_1, \dots, s_n\} $, then output $ -1 $.
Otherwise, output:
$$
\sum_{\ell \in p} \text{cost}(\ell)
$$