Problem: 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.

Input

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: a1, a2, ..., an (1 ≤ ai ≤ 109).

Output

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 ith of them should contain the content of the ith 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.

Examples

Input

5 5 3
2 6 10 5 9


Output

YES
1 9
1 5
1 10
1 6
1 2


Input

5 5 3
7 14 2 9 5


Output

NO


Input

5 3 1
1 2 3 7 5


Output

YES
3 5 1 3
1 7
1 2

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;

/**
 * Created by fangxue.zhang on 2014/6/4.
 */
public class CF_251_div2 {

    public static void main(String[] args) throws IOException {
        input.init(System.in);

        //AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
//        int n = input.nextInt(), d = input.nextInt();
//
//        int tot = 0;
//        for(int i = 0; i < n; i++)
//        {
//            int x = input.nextInt();
//            tot += x;
//        }
//        tot += (n - 1) * 10;
//
//        if(tot > d){
//            System.out.println(-1);
//            return;
//        }
//        int res = 0;
//        res += (n - 1) * 2;
//        res += (d - tot) / 5;
//
//        System.out.println(res);



        //BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB
//        int n = input.nextInt(), x = input.nextInt();
//
//        List<Integer> list = new LinkedList<Integer>();
//
//        for(int i = 0; i < n; i++){
//            int t = input.nextInt();
//            list.add(t);
//        }
//
//        Collections.sort(list);
//
//        long res = 0;
//        for(Integer val : list){
//            res += (long) val * (long) x;
//            x -= 1;
//            if(x <= 1) x = 1;
//        }
//
//
//        System.out.println(res);
//CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC
        int n = input.nextInt(), k = input.nextInt(), p = input.nextInt();

        List<Integer> evenList = new ArrayList<Integer>();

        List<Integer> oddList = new ArrayList<Integer>();

        for(int i = 0; i < n; i++){
            int x = input.nextInt();
            if(x % 2 == 0){
                evenList.add(x);
            }
            else
            {
                oddList.add(x);
            }
        }

        if(k > n){
            System.out.println("NO");
            return;
        }

        if(oddList.size() < k - p){
            System.out.println("NO");
            return;
        }

        int c = oddList.size() - (k - p);
        if(c % 2 != 0){
            System.out.println("NO");
            return;
        }

        if(evenList.size() + c / 2 < p){
            System.out.println("NO");
            return;
        }

        System.out.println("YES");

        if(p == 0){
            for(int i = 0; i < k - 1; i++){
                System.out.println("1 " + oddList.get(i));
            }
            System.out.print(oddList.size() - k + 1 + evenList.size());
            for(int i = k - 1; i < oddList.size(); i++){
                System.out.print(" " + oddList.get(i));
            }
            for(int i = 0; i < evenList.size(); i++)
                System.out.print(" " + evenList.get(i));
            return;
        }

        for(int i = 0; i < k - p; i++){
            System.out.println("1 " + oddList.get(i));
        }



        //dayin even
        if(evenList.size() >= p){
            //print
            for(int i = 0; i < p - 1; i++){
                System.out.println("1 " + evenList.get(i));
            }
            int cnt = evenList.size() - (p - 1) + (oddList.size() - (k - p));

            //print
            System.out.print(cnt);
            for(int i = p - 1; i < evenList.size(); i++){
                System.out.print(" " + evenList.get(i));
            }
            for(int i = k - p; i < oddList.size(); i++){
                System.out.print(" " + oddList.get(i));
            }
        }
        else{

            //print
            for(int i = 0; i < evenList.size(); i++){
                System.out.println("1 " + evenList.get(i));
            }
            int cnt = p - evenList.size();

            //print
            int idx = k - p;
            while(cnt > 1){
                System.out.print("2");
                System.out.print(" " + oddList.get(idx));
                idx += 1;
                System.out.println(" " + oddList.get(idx));
                idx += 1;
                cnt -= 1;
            }

            //print
            System.out.print(oddList.size() - idx);
            for(int i = idx; i < oddList.size(); i++){
                System.out.print(" " + oddList.get(i));
            }

        }


        //DDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDD

//        int n = input.nextInt(), m = input.nextInt();
//
//        List<Integer> alist = new ArrayList<Integer>();
//        List<Integer> blist = new ArrayList<Integer>();
//
//        List<Long> aslist = new ArrayList<Long>();
//        List<Long> bslist = new ArrayList<Long>();
//
//        for(int i = 0; i < n; i++){
//            int x = input.nextInt();
//            alist.add(x);
//        }
//        for(int i = 0; i < m; i++){
//            int x=  input.nextInt();
//            blist.add(x);
//        }
//
//        Collections.sort(alist);
//        Collections.sort(blist);
//
//        long sum = 0;
//        for(int i = 0; i < n; i++){
//            sum += (long) alist.get(i);
//            aslist.add(sum);
//        }
//
//        sum = 0;
//        for(int i = 0; i < m; i++){
//            sum += (long) blist.get(i);
//            bslist.add(sum);
//        }
//
//        if(alist.get(0) >= blist.get(m - 1)){
//            System.out.println(0);
//            return;
//        }
//
//        long res = 10000000000000000L;
//
//        for(int i = 0; i < alist.size(); i++){
//            long tmp = (long)alist.get(i) * (long) (i + 1) - aslist.get(i);
//
//            int l = 0, r = m - 1;
//
//            int val = alist.get(i);
//            int mid = 0;
//            while(l < r){
//                mid = (l + r) / 2;
//                if(val <= blist.get(mid)) r = mid;
//                else l = mid + 1;
//
//            }
//            mid = (l + r) / 2;
//
//            while(mid < m && blist.get(mid) < val) mid += 1;
//            if(mid == m){
//                tmp += 0;
//            }
//            else{
//                while(mid >= 0 && blist.get(mid) > val ) mid -= 1;
//                if(mid == -1){
//                    tmp += bslist.get(m - 1) - (long) val * (long) (m);
//                }
//                else{
//                    tmp += bslist.get(m - 1) - bslist.get(mid) - (long) val * (long) (m - mid - 1);
//                }
//            }
//
//            if(res > tmp) res = tmp;
////            System.out.println(i + " " + tmp);
////            System.out.println("=======================");
//
//
//        }
//
//        for(int i = 0; i < blist.size(); i++){
//            long tmp = bslist.get(m - 1) - bslist.get(i) - (long) blist.get(i) * (m - i - 1);
//
//            int l = 0, r = n - 1;
//            int val = blist.get(i);
//
//            int mid = 0;
//            while(l < r){
//                mid = (l + r) / 2;
//                if(val <= alist.get(mid)) r = mid;
//                else l = mid + 1;
//            }
//            mid = (l + r) / 2;
//
//            while(mid < n && alist.get(mid) < val) mid += 1;
//
//            if(mid == n){
//                tmp += (long) val * (long) n - aslist.get(n - 1);
//            }
//            else{
//                while(mid >= 0 && alist.get(mid) > val) mid -= 1;
//                if(mid == -1){
//                    tmp += 0;
//                }
//                else{
//                    tmp += (long) val * (long)(mid + 1) - aslist.get(mid);
//
//                }
//            }
//
//            if(res > tmp) res = tmp;
//        }
//
//        System.out.println(res);

    }






    public static class input {
        static BufferedReader reader;
        static StringTokenizer tokenizer;

        /** call this method to initialize reader for InputStream */
        static void init(InputStream input) {
            reader = new BufferedReader(
                    new InputStreamReader(input) );
            tokenizer = new StringTokenizer("");
        }

        /** get next word */
        static String next() throws IOException {
            while ( ! tokenizer.hasMoreTokens() ) {
                //TODO add check for eof if necessary
                tokenizer = new StringTokenizer(
                        reader.readLine() );
            }
            return tokenizer.nextToken();
        }

        static int nextInt() throws IOException {
            return Integer.parseInt( next() );
        }

        static double nextDouble() throws IOException {
            return Double.parseDouble( next() );
        }
        static long nextLong() throws IOException {
            return Long.parseLong( next() );
        }
    }


}