CF439C.Devu and Partitioning of the Array

Devu being a small kid, likes to play a lot, but he only likes to play with arrays. While playing he came up with an interesting question which he could not solve, can you please solve it for him?

Given an array consisting of distinct integers. Is it possible to partition the whole array into k disjoint non-empty parts such that p of the parts have even sum (each of them must have even sum) and remaining k - p have odd sum? (note that parts need not to be continuous).

If it is possible to partition the array, also give any possible way of valid partitioning.

Devu 是个小孩子，非常喜欢玩耍，但他只喜欢和数组玩耍。在玩耍时，他提出了一个有趣的题目，却无法解答。你能帮他解决吗？

给定一个由互不相同的整数组成的数组。能否将整个数组划分为 $k$ 个互不相交的非空子集，使得其中 $p$ 个子集的元素和为偶数（每个这样的子集的和都必须是偶数），其余 $k - p$ 个子集的元素和为奇数？（注意：这些子集不必是原数组中的连续子数组。）

如果可以划分，请同时给出一种可行的划分方案。

The first line will contain three space separated integers n, k, p (1 ≤ k ≤ n ≤ 105; 0 ≤ p ≤ k). The next line will contain n space-separated distinct integers representing the content of array a: _a_1, _a_2, ..., a__n (1 ≤ a__i ≤ 109).

第一行包含三个用空格分隔的整数 $n$、$k$、$p$（$1 \le k \le n \le 10^5$；$0 \le p \le k$）。
下一行包含 $n$ 个用空格分隔的互不相同的整数，表示数组 $a$ 的内容：$a_1,\,a_2,\,...,\,a_n$（$1 \le a_i \le 10^9$）。

In the first line print "YES" (without the quotes) if it is possible to partition the array in the required way. Otherwise print "NO" (without the quotes).

If the required partition exists, print k lines after the first line. The i__th of them should contain the content of the i__th part. Print the content of the part in the line in the following way: firstly print the number of elements of the part, then print all the elements of the part in arbitrary order. There must be exactly p parts with even sum, each of the remaining k - p parts must have odd sum.

As there can be multiple partitions, you are allowed to print any valid partition.

第一行输出 "YES"（不带引号），如果可以按要求将数组划分；否则输出 "NO"（不带引号）。

如果存在满足要求的划分，则在第一行之后输出 k 行。其中第 i 行应包含第 i 个部分的内容。该部分的内容按如下方式输出：首先输出该部分的元素个数，然后以任意顺序输出该部分的所有元素。其中必须恰好有 p 个部分的元素和为偶数，其余 k - p 个部分的元素和必须为奇数。

由于可能存在多种合法划分，你只需输出任意一种合法划分即可。