#include <bits/stdc++.h>
using namespace std;
const long long maxn = 1e5 + 10;
vector<int> a[maxn];
int arr[maxn];
int main() {
  long long n, k, p, sum = 0;
  cin >> n >> k >> p;
  vector<int> e;
  vector<int> o;
  for (int i = (int)(0); i < (int)(n); i++) {
    cin >> arr[i];
    sum += arr[i];
    if (arr[i] % 2 == 0)
      e.push_back(arr[i]);
    else
      o.push_back(arr[i]);
  }
  if (sum % 2 != (k - p) % 2 or k - p > o.size() or
      (k - p) % 2 != (o.size() % 2) or e.size() + (o.size() - k + p) / 2 < p) {
    cout << "NO" << endl;
    return 0;
  }
  int cnt = 0;
  if (p == 0) {
    if (o.size() < p and o.size() - p % 2 == 0) {
      cout << "NO" << endl;
      return 0;
    } else {
      cout << "YES" << endl;
      while (cnt < k - 1) {
        cout << 1 << " " << o[o.size() - 1] << endl;
        o.pop_back();
        cnt++;
      }
      cout << n - k + 1 << " ";
      while (o.size() > 0) {
        cout << o[o.size() - 1] << " ";
        o.pop_back();
      }
      while (e.size() > 0) {
        cout << e[e.size() - 1] << " ";
        e.pop_back();
      }
    }
    return 0;
  }
  for (int i = (int)(0); i < (int)(k - p); i++) {
    a[cnt].push_back(o[o.size() - 1]);
    o.pop_back();
    cnt++;
  }
  for (int i = (int)(0); i < (int)(p - 1); i++) {
    if (e.size() >= 1) {
      a[cnt].push_back(e[e.size() - 1]);
      e.pop_back();
    } else {
      a[cnt].push_back(o[o.size() - 1]);
      o.pop_back();
      a[cnt].push_back(o[o.size() - 1]);
      o.pop_back();
    }
    cnt++;
  }
  while (e.size() > 0 or o.size() > 0) {
    if (e.size() > 0) {
      a[cnt].push_back(e[e.size() - 1]);
      e.pop_back();
    }
    if (o.size() > 0) {
      a[cnt].push_back(o[o.size() - 1]);
      o.pop_back();
    }
  }
  cout << "YES" << endl;
  for (int i = (int)(0); i < (int)(k); i++) {
    cout << a[i].size() << " ";
    for (int j = (int)(0); j < (int)(a[i].size()); j++) cout << a[i][j] << " ";
    cout << endl;
  }
}
