#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast", "unroll-loops", "omit-frame-pointer", "inline")
const long long maxn = 1000010;
const long long mod = 1000000007;
const long double eps = 1e-9;
const long long inf = ((1ll << 31ll) - 1ll);
const long long INF = 1ll * mod * mod;
const long double pi = acos(-1);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long qpow(long long b, long long e) {
  if (!e) return 1;
  if (e & 1) return qpow(b, e - 1) * b % mod;
  long long pwur = qpow(b, e >> 1);
  return pwur * pwur % mod;
}
long long modinv(long long x) { return qpow(x, mod - 2); }
long long n, k, p;
vector<long long> od, ev, ans[maxn];
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.setf(ios::fixed);
  cout.precision(0);
  srand(time(NULL));
  cin >> n >> k >> p;
  for (long long i = 1; i <= n; i++) {
    long long u;
    cin >> u;
    if (u % 2)
      od.push_back(u);
    else
      ev.push_back(u);
  }
  long long cnt = 0;
  for (long long i = 1; i <= k - p; i++) {
    cnt++;
    if (od.empty()) {
      cout << "NO\n";
      return 0;
    }
    ans[cnt].push_back(od.back());
    od.pop_back();
  }
  while (!od.empty()) {
    if (cnt < k) cnt++;
    if (od.size() == 1) {
      cout << "NO\n";
      return 0;
    }
    ans[cnt].push_back(od.back());
    od.pop_back();
    ans[cnt].push_back(od.back());
    od.pop_back();
  }
  while (!ev.empty()) {
    if (cnt == k) {
      ans[cnt].push_back(ev.back());
      ev.pop_back();
    } else {
      cnt++;
      ans[cnt].push_back(ev.back());
      ev.pop_back();
    }
  }
  if (cnt != k) {
    cout << "NO\n";
    return 0;
  }
  cout << "YES\n";
  for (long long i = 1; i <= k; i++) {
    cout << ans[i].size() << ' ';
    for (auto j : ans[i]) cout << j << ' ';
    cout << '\n';
  }
  return 0;
}
