#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
const int N = 1e6 + 7;
int n, m, p;
int cnt1, cnt2, res;
int a[N], b[N], opt[N];
vector<int> f[N];
int main() {
  n = read(), m = read(), p = read();
  for (int i = 1; i <= n; i++) {
    int x = read();
    if (x % 2 == 0) {
      a[++cnt1] = x;
    } else {
      b[++cnt2] = x;
    }
  }
  for (int i = 1; i <= m; i++) {
    if (cnt1)
      f[i].push_back(a[cnt1--]), res++, opt[i] = 0;
    else
      f[i].push_back(b[cnt2--]), opt[i] = 1;
  }
  int now = 0;
  while (res < p) {
    if (!cnt2) break;
    now++;
    if (opt[now]) {
      f[now].push_back(b[cnt2--]);
      res++;
      opt[now] ^= 1;
    }
  }
  if (!cnt2 && res < p) {
    printf("NO");
    return 0;
  }
  now = 0;
  while (res > p) {
    if (!cnt2) break;
    now++;
    if (!opt[now]) {
      f[now].push_back(b[cnt2--]);
      res--;
      opt[now] ^= 1;
    }
  }
  if (!cnt2 && res != p) {
    printf("NO");
    return 0;
  }
  if (res == p && cnt2 % 2) {
    printf("NO");
    return 0;
  }
  while (cnt1) {
    f[1].push_back(a[cnt1--]);
  }
  while (cnt2) {
    f[1].push_back(b[cnt2--]);
  }
  printf("YES\n");
  for (int i = 1; i <= m; i++) {
    int x = f[i].size();
    printf("%d ", x);
    for (int j = 0; j <= x - 1; j++) printf("%d ", f[i][j]);
    printf("\n");
  }
}
