#include <bits/stdc++.h>
using namespace std;
long long n, k, p, ar[200000], need;
vector<long long> ans[200000];
long long s;
vector<long long> v;
long long used[200000];
long long ps;
int main() {
  ios_base::sync_with_stdio(0);
  cin >> n >> k >> p;
  for (int i = 1; i <= n; i++) {
    cin >> ar[i];
    s += ar[i];
    if (ar[i] % 2) v.push_back(i);
  }
  need = k - p;
  need %= 2;
  if (need % 2 != s % 2) {
    cout << "NO" << endl;
    return 0;
  }
  if (v.size() < k - p) {
    cout << "NO" << endl;
    return 0;
  }
  for (int i = 0; i < k - p; i++) {
    ans[i].push_back(v[i]);
    used[v[i]] = 1;
  }
  ps = k - p;
  if (ps == k) ps = 0;
  for (int i = k - p; i < v.size(); i += 2) {
    ans[ps].push_back(v[i]);
    used[v[i]] = 1;
    ans[ps].push_back(v[i + 1]);
    used[v[i + 1]] = 1;
    ps++;
    if (ps == k) ps = 0;
  }
  ps = k - 1;
  for (int i = 1; i <= n; i++)
    if (used[i] == 0) {
      ans[ps].push_back(i);
      used[i] = 1;
      ps--;
      if (ps == -1) ps = k - 1;
    }
  long er = 0;
  for (int i = 0; i < k; i++)
    if (ans[i].size() == 0) er = 1;
  if (er) {
    cout << "NO" << endl;
    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 << " " << ar[ans[i][j]];
    }
    cout << endl;
  }
  cin.get();
  cin.get();
  return 0;
}
