#include <bits/stdc++.h>
using namespace std;
long long INFINIT = 100000000000000;
long long tree[300000];
long long lazy[300000];
vector<long long> ar;
vector<long long> ar2;
long long tree2[300000];
long long lazy2[300000];
int size;
void build(int left, int right, int vertex) {
  if (left == right) {
    tree[vertex] = ar[left];
    return;
  }
  build(left, (left + right) / 2, 2 * vertex);
  build(((left + right) / 2) + 1, right, 2 * vertex + 1);
  tree[vertex] = tree[2 * vertex] + tree[2 * vertex + 1];
}
void build2(int left, int right, int vertex) {
  if (left == right) {
    tree2[vertex] = ar2[left];
    return;
  }
  build2(left, (left + right) / 2, 2 * vertex);
  build2(((left + right) / 2) + 1, right, 2 * vertex + 1);
  tree2[vertex] = tree2[2 * vertex] + tree2[2 * vertex + 1];
}
void create() {
  memset(tree, 0, sizeof(tree));
  memset(lazy, 0, sizeof(lazy));
  memset(tree2, 0, sizeof(tree2));
  memset(lazy2, 0, sizeof(lazy2));
  build(0, size - 1, 1);
  build2(0, size - 1, 1);
}
long long rsq(int left, int right, int vertex, int i, int j) {
  if (i > right || left > j) {
    return 0;
  }
  if (left >= i && right <= j) {
    return tree[vertex];
  }
  long long v1 = rsq(left, (left + right) / 2, 2 * vertex, i, j);
  long long v2 = rsq(((left + right) / 2) + 1, right, 2 * vertex + 1, i, j);
  return v1 + v2;
}
long long rsq2(int left, int right, int vertex, int i, int j) {
  if (i > right || left > j) {
    return 0;
  }
  if (left >= i && right <= j) {
    return tree2[vertex];
  }
  long long v1 = rsq2(left, (left + right) / 2, 2 * vertex, i, j);
  long long v2 = rsq2(((left + right) / 2) + 1, right, 2 * vertex + 1, i, j);
  return v1 + v2;
}
long long query(int i, int j) { return rsq(0, size - 1, 1, i, j); }
long long query2(int i, int j) { return rsq2(0, size - 1, 1, i, j); }
int n, k, p;
int main() {
  cin >> n >> k >> p;
  vector<long long> even;
  vector<long long> odd;
  for (int i = 0; i < n; i++) {
    int num;
    cin >> num;
    if (num & 1) {
      odd.push_back(num);
    } else {
      even.push_back(num);
    }
  }
  vector<vector<long long> > even_sets(p);
  vector<vector<long long> > odd_sets(k - p);
  for (int i = 0; i < p; i++) {
    if (even.size() > 0) {
      even_sets[i].push_back(even[even.size() - 1]);
      even.pop_back();
    } else if (odd.size() < 2) {
      printf("NO\n");
      return 0;
    } else {
      even_sets[i].push_back(odd[odd.size() - 1]);
      odd.pop_back();
      even_sets[i].push_back(odd[odd.size() - 1]);
      odd.pop_back();
    }
  }
  if (odd_sets.size()) {
    for (int i = 0; i < k - p; i++) {
      if (odd.size() == 0) {
        printf("NO\n");
        return 0;
      }
      odd_sets[i].push_back(odd[odd.size() - 1]);
      odd.pop_back();
      if (even.size() > 0) {
        while (even.size()) {
          odd_sets[i].push_back(even[even.size() - 1]);
          even.pop_back();
        }
      }
    }
    if (odd.size()) {
      if (odd.size() % 2 == 0) {
        while (odd.size()) {
          odd_sets[0].push_back(odd[odd.size() - 1]);
          odd.pop_back();
        }
      } else {
        printf("NO\n");
        return 0;
      }
    }
  } else {
    while (even.size()) {
      even_sets[0].push_back(even[even.size() - 1]);
      even.pop_back();
    }
    if (odd.size() % 2) {
      printf("NO\n");
      return 0;
    }
    while (odd.size()) {
      even_sets[0].push_back(odd[odd.size() - 1]);
      odd.pop_back();
      even_sets[0].push_back(odd[odd.size() - 1]);
      odd.pop_back();
    }
  }
  printf("YES\n");
  for (int i = 0; i < even_sets.size(); i++) {
    cout << even_sets[i].size();
    for (int j = 0; j < even_sets[i].size(); j++) {
      cout << " " << even_sets[i][j];
    }
    cout << endl;
  }
  for (int i = 0; i < odd_sets.size(); i++) {
    cout << odd_sets[i].size();
    for (int j = 0; j < odd_sets[i].size(); j++) {
      cout << " " << odd_sets[i][j];
    }
    cout << endl;
  }
  return 0;
}
