#include <bits/stdc++.h>
using namespace std;
void displayGroups(vector<vector<int> >& groups) {
  for (int i = 0; i < groups.size(); i++) {
    cout << groups[i].size() << " ";
    for (int j = 0; j < groups[i].size(); j++) {
      cout << groups[i][j] << " ";
    }
    cout << endl;
  }
}
int main() {
  int n, k, p;
  cin >> n >> k >> p;
  long long int sum = 0;
  vector<int> even, odd;
  vector<vector<int> > groups;
  for (int i = 0; i < n; i++) {
    int c;
    cin >> c;
    sum += (long long int)c;
    if (c % 2) {
      odd.push_back(c);
    } else {
      even.push_back(c);
    }
  }
  if (sum % 2 != (k - p) % 2 || odd.size() < k - p ||
      even.size() + (odd.size() - (k - p)) / 2 < p) {
    cout << "NO" << endl;
    return 0;
  }
  for (int i = 0; i < k - p; i++) {
    groups.push_back(vector<int>());
    groups.back().push_back(odd.back());
    odd.pop_back();
  }
  if (even.size() < p) {
    for (int i = 0; i < even.size(); i++) {
      groups.push_back(vector<int>());
      groups.back().push_back(even[i]);
    }
    for (int i = 0; i < p - even.size(); i++) {
      groups.push_back(vector<int>());
      groups.back().push_back(odd.back());
      odd.pop_back();
      groups.back().push_back(odd.back());
      odd.pop_back();
    }
    even.clear();
  } else {
    for (int i = 0; i < p; i++) {
      groups.push_back(vector<int>());
      groups.back().push_back(even.back());
      even.pop_back();
    }
  }
  for (int i = 0; i < odd.size(); i++) {
    groups[0].push_back(odd[i]);
  }
  for (int i = 0; i < even.size(); i++) {
    groups[0].push_back(even[i]);
  }
  cout << "YES" << endl;
  displayGroups(groups);
  return 0;
}
