CF999F.Cards and Joy

There are $n$ players sitting at the card table. Each player has a favorite number. The favorite number of the $j$-th player is $f_j$.

There are $k \cdot n$ cards on the table. Each card contains a single integer: the $i$-th card contains number $c_i$. Also, you are given a sequence $h_1, h_2, \dots, h_k$. Its meaning will be explained below.

The players have to distribute all the cards in such a way that each of them will hold exactly $k$ cards. After all the cards are distributed, each player counts the number of cards he has that contains his favorite number. The joy level of a player equals $h_t$ if the player holds $t$ cards containing his favorite number. If a player gets no cards with his favorite number (i.e., $t=0$), his joy level is $0$.

Print the maximum possible total joy levels of the players after the cards are distributed. Note that the sequence $h_1, \dots, h_k$ is the same for all the players.

有 $n$ 名玩家围坐在一张牌桌旁。每名玩家都有一个最喜爱的数字，第 $j$ 名玩家最喜爱的数字为 $f_j$。

桌上有 $k \cdot n$ 张牌。每张牌上写有一个整数：第 $i$ 张牌上的数字为 $c_i$。此外，你还被给定一个序列 $h_1, h_2, \dots, h_k$，其含义将在下文说明。

玩家需将所有牌分发完毕，使得每人恰好持有 $k$ 张牌。在所有牌分发完毕后，每名玩家统计自己手中写有其最喜爱数字的牌的数量。若某玩家手中恰好有 $t$ 张写有其最喜爱数字的牌，则该玩家的快乐值为 $h_t$；若某玩家手中没有写有其最喜爱数字的牌（即 $t = 0$），则其快乐值为 $0$。

请输出在所有可能的分牌方案中，所有玩家快乐值之和的最大可能值。注意，对所有玩家而言，序列 $h_1, \dots, h_k$ 是完全相同的。

The first line of input contains two integers $n$ and $k$ ($1 \le n \le 500, 1 \le k \le 10$) — the number of players and the number of cards each player will get.

The second line contains $k \cdot n$ integers $c_1, c_2, \dots, c_{k \cdot n}$ ($1 \le c_i \le 10^5$) — the numbers written on the cards.

The third line contains $n$ integers $f_1, f_2, \dots, f_n$ ($1 \le f_j \le 10^5$) — the favorite numbers of the players.

The fourth line contains $k$ integers $h_1, h_2, \dots, h_k$ ($1 \le h_t \le 10^5$), where $h_t$ is the joy level of a player if he gets exactly $t$ cards with his favorite number written on them. It is guaranteed that the condition $h_{t - 1} \lt h_t$ holds for each $t \in [2..k]$.

输入的第一行包含两个整数 $n$ 和 $k$（$1 \le n \le 500$，$1 \le k \le 10$）—— 分别表示玩家人数以及每位玩家将获得的卡片数量。

第二行包含 $k \cdot n$ 个整数 $c_1, c_2, \dots, c_{k \cdot n}$（$1 \le c_i \le 10^5$）—— 表示每张卡片上所写的数字。

第三行包含 $n$ 个整数 $f_1, f_2, \dots, f_n$（$1 \le f_j \le 10^5$）—— 表示各位玩家各自喜欢的数字。

第四行包含 $k$ 个整数 $h_1, h_2, \dots, h_k$（$1 \le h_t \le 10^5$），其中 $h_t$ 表示某位玩家恰好获得 $t$ 张写有其喜欢数字的卡片时所获得的快乐值。保证对每个 $t \in [2..k]$ 均满足 $h_{t - 1} \lt h_t$。

Print one integer — the maximum possible total joy levels of the players among all possible card distributions.

输出一个整数——在所有可能的卡片分配方案中，玩家总喜悦度的最大值。

In the first example, one possible optimal card distribution is the following:

• Player $1$ gets cards with numbers $[1, 3, 8]$;
• Player $2$ gets cards with numbers $[2, 2, 8]$;
• Player $3$ gets cards with numbers $[2, 2, 8]$;
• Player $4$ gets cards with numbers $[5, 5, 5]$.

Thus, the answer is $2 + 6 + 6 + 7 = 21$.

In the second example, no player can get a card with his favorite number. Thus, the answer is $0$.

在第一个例子中，一种可能的最优发牌方案如下：

• 玩家 $1$ 获得编号为 $[1, 3, 8]$ 的牌；
• 玩家 $2$ 获得编号为 $[2, 2, 8]$ 的牌；
• 玩家 $3$ 获得编号为 $[2, 2, 8]$ 的牌；
• 玩家 $4$ 获得编号为 $[5, 5, 5]$ 的牌。

因此，答案为 $2 + 6 + 6 + 7 = 21$。

在第二个例子中，没有任何玩家能获得其最喜欢数字的牌。因此，答案为 $0$。