#include <bits/stdc++.h>
using namespace std;
int a[1000003], od[1000003], ev[1000003];
vector<int> v[1000003];
int main() {
  int n, k, p, odd = 0, even = 0;
  int t = 0;
  cin >> n >> k >> p;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    if (a[i] & 1)
      od[odd++] = a[i];
    else
      ev[even++] = a[i];
  }
  int i, tmp1 = 0, tmp2 = 0;
  for (i = 0; i < p; i++) {
    if (i < even)
      v[t++].push_back(ev[tmp2++]);
    else {
      v[t].push_back(od[tmp1++]);
      v[t++].push_back(od[tmp1++]);
    }
  }
  for (i = tmp2; i < even; i++) v[0].push_back(ev[i]);
  for (i = 0; i < k - p && tmp1 < odd; i++) {
    v[t++].push_back(od[tmp1++]);
  }
  if (((odd - tmp1) & 1) || t != k)
    cout << "NO" << endl;
  else {
    for (i = tmp1; i < odd; i++) v[t - 1].push_back(od[i]);
    cout << "YES" << endl;
    for (int j = 0; j < t; j++) {
      cout << v[j].size();
      for (int q = 0; q < v[j].size(); q++) {
        cout << " " << v[j][q];
      }
      cout << endl;
    }
  }
  return 0;
}
