#include <bits/stdc++.h>
using namespace std;
long long n, k, x, p;
vector<long long> ans[200000], parne, neparne;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n >> k >> p;
  for (int i = 0; i < n; i++) {
    cin >> x;
    if (x % 2 == 0)
      parne.push_back(x);
    else
      neparne.push_back(x);
  }
  for (int i = 0; i < min(k - p, k - 1); i++)
    if (neparne.empty()) {
      cout << "NO";
      return 0;
    } else {
      ans[i].push_back(neparne.back());
      neparne.pop_back();
    }
  for (int i = k - p; i < k - 1; i++)
    if (parne.empty() && neparne.size() < 2) {
      cout << "NO";
      return 0;
    } else if (!parne.empty()) {
      ans[i].push_back(parne.back());
      parne.pop_back();
    } else {
      ans[i].push_back(neparne.back());
      neparne.pop_back();
      ans[i].push_back(neparne.back());
      neparne.pop_back();
    }
  long long t;
  while (!parne.empty()) {
    ans[k - 1].push_back(parne.back());
    t += parne.back();
    parne.pop_back();
  }
  while (!neparne.empty()) {
    ans[k - 1].push_back(neparne.back());
    t += neparne.back();
    neparne.pop_back();
  }
  if (p == 0) {
    if (t % 2 == 0 || ans[k - 1].size() == 0) {
      cout << "NO";
      return 0;
    }
  } else if (t % 2 == 1 || ans[k - 1].size() == 0) {
    cout << "NO";
    return 0;
  }
  cout << "YES" << endl;
  for (int i = 0; i < k; i++) {
    cout << ans[i].size() << " ";
    for (int j = 0; j < ans[i].size(); j++) cout << ans[i][j] << " ";
    cout << endl;
  }
}
