AT_awc0002_b 果物の選別

Takahashi is in charge of shipping fruits harvested at a farm. $ N $ fruits have been harvested at the farm, each numbered from $ 1 $ to $ N $ . For each fruit $ i $ $ (1 \leq i \leq N) $ , a sweetness level $ A_i $ has been measured; the higher this value, the sweeter and more delicious the fruit. It was discovered that $ M $ fruits have bruises. The numbers of the bruised fruits are given as $ B_1, B_2, \ldots, B_M $ (the order has no special meaning). Normally, bruised fruits are shipped as substandard products through a separate route from the regular one. However, fruits with a sweetness level of $ K $ or higher (i.e., $ A_i \geq K $ ) are treated specially as premium products, so even if they have bruises, they are not classified as substandard and are included in the regular shipping route. In summary, fruits that **have bruises and have a sweetness level less than $ K $** are shipped as substandard products. Find the number of fruits that Takahashi should ultimately ship as substandard products, and the total sweetness level of those fruits.

> $ N $ $ M $ $ K $ $ A_1 $ $ A_2 $ $ \ldots $ $ A_N $ $ B_1 $ $ B_2 $ $ \ldots $ $ B_M $ - The first line contains $ N $ representing the total number of fruits, $ M $ representing the number of bruised fruits, and $ K $ representing the sweetness threshold for premium classification, separated by spaces. - The second line contains the sweetness levels of each fruit $ A_1, A_2, \ldots, A_N $ , separated by spaces. - $ A_i $ represents the sweetness level of fruit $ i $ . - The third line contains the numbers of the bruised fruits $ B_1, B_2, \ldots, B_M $ , separated by spaces. - $ B_j $ represents the number of a bruised fruit.

Print the number of fruits to be shipped as substandard products and the total sweetness level of those fruits, separated by a space, on a single line.

### Constraints - $ 1 \leq N \leq 2 \times 10^5 $ - $ 1 \leq M \leq N $ - $ 1 \leq K \leq 10^9 $ - $ 1 \leq A_i \leq 10^9 $ $ (1 \leq i \leq N) $ - $ 1 \leq B_j \leq N $ $ (1 \leq j \leq M) $ - $ B_1, B_2, \ldots, B_M $ are all distinct - All inputs are integers