#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k, p, i, e1, o1, j;
  cin >> n >> k >> p;
  vector<int> even, odd, v(n), v1[k], v2(n);
  for (i = 0; i < n; i++) {
    cin >> v[i];
    if (v[i] % 2 == 0)
      even.push_back(v[i]);
    else
      odd.push_back(v[i]);
  }
  e1 = even.size();
  o1 = odd.size();
  if (k - p > o1 || (o1 - (k - p)) % 2 == 1 || e1 + (o1 - (k - p)) / 2 < p) {
    cout << "NO" << endl;
    return 0;
  }
  cout << "YES" << endl;
  if (p == 0) {
    int j = 1;
    for (i = 0; i <= o1 - k; i++) {
      v1[0].push_back(odd[i]);
    }
    for (i = o1 - k + 1; i < o1; i++) {
      v1[j].push_back(odd[i]);
      j++;
    }
    for (i = 0; i < even.size(); i++) v1[0].push_back(even[i]);
    for (i = 0; i < k; i++) {
      cout << v1[i].size() << " ";
      for (j = 0; j < v1[i].size(); j++) cout << v1[i][j] << " ";
      cout << endl;
    }
    return 0;
  }
  for (i = 0; i < k - p; i++) {
    v1[i].push_back(odd[i]);
  }
  j = k - p;
  for (i = k - p; i < o1; i += 2) {
    if (j >= k) j = k - p;
    v1[j].push_back(odd[i]);
    v1[j].push_back(odd[i + 1]);
    j++;
  }
  for (i = 0; i < e1; i++) {
    if (j >= k) j = k - p;
    v1[j].push_back(even[i]);
    j++;
  }
  for (i = 0; i < k; i++) {
    cout << v1[i].size() << " ";
    for (j = 0; j < v1[i].size(); j++) cout << v1[i][j] << " ";
    cout << endl;
  }
  return 0;
}
