CF799E.Aquarium decoration

Arkady and Masha want to choose decorations for thier aquarium in Fishdom game. They have n decorations to choose from, each of them has some cost. To complete a task Arkady and Masha need to choose exactly m decorations from given, and they want to spend as little money as possible.

There is one difficulty: Masha likes some a of the given decorations, Arkady likes some b of the given decorations. Some decorations may be liked by both Arkady and Masha, or not be liked by both. The friends want to choose such decorations so that each of them likes at least k decorations among the chosen. Help Masha and Arkady find the minimum sum of money they need to spend.

阿尔卡季和玛莎想为他们在《Fishdom》游戏中的水族箱挑选装饰品。他们共有 $n$ 个装饰品可供选择，每个装饰品都有一定的价格。为了完成任务，阿尔卡季和玛莎需要从这 $n$ 个装饰品中恰好挑选 $m$ 个，且希望花费的总金额尽可能少。

但存在一个限制条件：玛莎喜欢其中 $a$ 个装饰品，阿尔卡季喜欢其中 $b$ 个装饰品。某些装饰品可能同时被两人喜欢，也可能两人都不喜欢。两位朋友希望所选的 $m$ 个装饰品满足：每人至少喜欢其中 $k$ 个。请帮助玛莎和阿尔卡季找出满足条件的最小总花费。

The first line contains three integers n, m and k (1 ≤ n ≤ 200000, 1 ≤ m ≤ n, 1 ≤ k ≤ n) — the number of decorations, how many decorations the friends should choose, how many decorations each of them should like among the chosen.

The second line contains n integers _c_1, _c_2, ..., c__n (1 ≤ c__i ≤ 109) — decorations costs.

The third line contains single integer a (1 ≤ a ≤ n) — the number of decorations liked by Masha. The fourth line contains a distinct integers _x_1, _x_2, ..., x__a (1 ≤ x__i ≤ n) — the ids of decorations liked by Masha.

The next two lines describe decorations liked by Arkady in the same format.

第一行包含三个整数 $n$、$m$ 和 $k$（$1 \leq n \leq 200000$，$1 \leq m \leq n$，$1 \leq k \leq n$）—— 分别表示装饰品总数、朋友们需选择的装饰品数量，以及每人需在所选装饰品中喜欢的数量。

第二行包含 $n$ 个整数 $c_1, c_2, ..., c_n$（$1 \leq c_i \leq 10^9$）—— 各装饰品的价格。

第三行包含一个整数 $a$（$1 \leq a \leq n$）—— 玛莎喜欢的装饰品数量。第四行包含 $a$ 个互不相同的整数 $x_1, x_2, ..., x_a$（$1 \leq x_i \leq n$）—— 玛莎喜欢的装饰品编号。

接下来两行以相同格式描述阿尔卡季喜欢的装饰品。

Print single integer: the minimum sum of money the friends should spend to fulfill all constraints. If it is not possible, print -1.

输出一个整数：朋友们为满足所有约束条件所需花费的最少金额。若无法满足，则输出 $-1$。

In the first example the only possible variant to choose 3 decorations having all conditions satisfied is to choose decorations 1, 2, 3.

In the second example friends can choose decoration 4 instead of decoration 3, because this one is one coin cheaper.

In the third example it's not possible to choose 2 decorations in a way that both are liked by both Masha and Arkady.

在第一个例子中，唯一满足所有条件的、选择 3 个装饰品的方案是选择装饰品 1、2、3。

在第二个例子中，朋友们可以选择装饰品 4 代替装饰品 3，因为前者便宜一枚硬币。

在第三个例子中，无法选择 2 个装饰品，使得它们同时被玛莎和阿尔卡季所喜欢。