#include <bits/stdc++.h>
using namespace std;
int xx[4] = {0, 0, 1, -1};
int yy[4] = {1, -1, 0, 0};
int n, k, p, s;
vector<int> q[3];
int main() {
  scanf("%d%d%d", &n, &k, &p);
  int x = k - p;
  int y = p;
  for (int i = (1), _b = (n); i <= _b; i++) {
    int u;
    scanf("%d", &u);
    q[u % 2].push_back(u);
    s = (s + u) % 2;
  }
  if (q[1].size() < x || (q[1].size() - x) % 2 == 1) {
    cout << "NO" << endl;
    return 0;
  }
  int d = (q[1].size() - x) / 2 + q[0].size();
  if (d < y) {
    cout << "NO" << endl;
    return 0;
  }
  cout << "YES" << endl;
  for (int i = (0), _b = (x - 2); i <= _b; i++) {
    printf("%d %d\n", 1, q[1][i]);
  }
  if (y == 0) {
    printf("%d ", (q[1].size() - x + 1) + q[0].size());
    for (int i = (x - 1), _b = (q[1].size() - 1); i <= _b; i++)
      printf("%d ", q[1][i]);
    for (int i = (0), _b = (q[0].size() - 1); i <= _b; i++)
      printf("%d ", q[0][i]);
    return 0;
  } else {
    if (x - 1 >= 0) printf("%d %d\n", 1, q[1][x - 1]);
  }
  int l = x;
  if (y > 1)
    for (int i = x; i + 2 <= q[1].size(); i += 2) {
      printf("%d %d %d\n", 2, q[1][i], q[1][i + 1]);
      y--;
      l = i + 2;
      if (y == 1) break;
    }
  if (y == 1) {
    printf("%d ", q[1].size() - l + q[0].size());
    for (int i = (l), _b = (q[1].size() - 1); i <= _b; i++)
      printf("%d ", q[1][i]);
    for (int i = (0), _b = (q[0].size() - 1); i <= _b; i++)
      printf("%d ", q[0][i]);
    return 0;
  }
  l = 0;
  if (y != 1)
    for (int i = (0), _b = (q[0].size() - 1); i <= _b; i++) {
      printf("%d %d\n", 1, q[0][i]);
      y--;
      l = i + 1;
      if (y == 1) break;
    }
  if (l != q[0].size()) {
    printf("%d ", q[0].size() - l);
    for (int i = (l), _b = (q[0].size() - 1); i <= _b; i++)
      printf("%d ", q[0][i]);
  }
}
