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.
The first line will contain three space separated integers *n*, *k*, *p* (1 ≤ *k* ≤ *n* ≤ 10<sup class="upper-index">5</sup>; 0 ≤ *p* ≤ *k*). The next line will contain *n* space-separated distinct integers representing the content of array *a*: *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub> (1 ≤ *a*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">9</sup>).
import os
import sys
from io import BytesIO, IOBase
from functools import cmp_to_key

BUFSIZE = 4096
class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()
    
    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")

sys.stdin = IOWrapper(sys.stdin)
sys.stdout = IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")

def I():
    return input()

def II():
    return int(input())

def LII():
    return list(map(int, input().split()))

n, k, even = LII()
a = LII()
g = {0:[], 1: []}
for i in range(n):
    if a[i] % 2 == 0:
        g[0].append(a[i])
    else:
        g[1].append(a[i])
e, o = g[0], g[1]
odd = k - even

left_odd = len(o) - odd
if left_odd < 0 or (left_odd & 1) > 0 or len(e) + left_odd // 2 < even:
    print("NO")
    sys.exit()
print("YES")
if even == 0:
    odd -= 1
for _, v in enumerate(o[:odd]):
    print(1, v)
o = o[odd:]
for i in range(1, even):
    if len(e) > 0:
        print(1, e[0])
        e = e[1:]
    else:
        print(2, o[0], o[1])
        o = o[2:]
e.extend(o)
print(len(e), end = " ")
for _, v in enumerate(e):
    print(v, end=" ")

