Problem: Devu being a small kid, likes to play a lot, but he only likes to play with arrays. While playing he came up with an interesting question which he could not solve, can you please solve it for him?

Given an array consisting of distinct integers. Is it possible to partition the whole array into k disjoint non-empty parts such that p of the parts have even sum (each of them must have even sum) and remaining k - p have odd sum? (note that parts need not to be continuous).

If it is possible to partition the array, also give any possible way of valid partitioning.

Input

The first line will contain three space separated integers n, k, p (1 ≤ k ≤ n ≤ 105; 0 ≤ p ≤ k). The next line will contain n space-separated distinct integers representing the content of array a: a1, a2, ..., an (1 ≤ ai ≤ 109).

Output

In the first line print "YES" (without the quotes) if it is possible to partition the array in the required way. Otherwise print "NO" (without the quotes).

If the required partition exists, print k lines after the first line. The ith of them should contain the content of the ith part. Print the content of the part in the line in the following way: firstly print the number of elements of the part, then print all the elements of the part in arbitrary order. There must be exactly p parts with even sum, each of the remaining k - p parts must have odd sum.

As there can be multiple partitions, you are allowed to print any valid partition.

Examples

Input

5 5 3
2 6 10 5 9


Output

YES
1 9
1 5
1 10
1 6
1 2


Input

5 5 3
7 14 2 9 5


Output

NO


Input

5 3 1
1 2 3 7 5


Output

YES
3 5 1 3
1 7
1 2

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
long long mult(long long a, long long b, long long p = 1000000007) {
  return ((a % p) * (b % p)) % p;
}
long long add(long long a, long long b, long long p = 1000000007) {
  return (a % p + b % p) % p;
}
long long fpow(long long n, long long k, long long p = 1000000007) {
  long long r = 1;
  for (; k; k >>= 1LL) {
    if (k & 1LL) r = mult(r, n, p);
    n = mult(n, n, p);
  }
  return r;
}
long long inv(long long a, long long p = 1000000007) {
  return fpow(a, p - 2, p);
}
void self_max(int &a, int &b) { a = max(a, b); }
void self_min(int &a, int &b) { a = min(a, b); }
const int INF = 1e9 + 5;
void solve() {
  int n, k, p;
  cin >> n >> k >> p;
  vector<long long> odd, even;
  int ev = p;
  int od = k - p, ind = 0;
  vector<long long> ans[k];
  for (int i = 0; i < n; i++) {
    int t;
    cin >> t;
    if (t % 2 == 0) {
      even.push_back(t);
      ans[ind].push_back(t);
      ind++;
      ind %= k;
    } else
      odd.push_back(t);
  }
  if (2 * max(0, ev - (int)even.size()) > (int)odd.size()) {
    cout << "NO" << '\n';
    return;
  }
  int rem = (int)odd.size() - 2 * max(0, ev - (int)even.size());
  if (rem < od) {
    cout << "NO" << '\n';
    return;
  }
  rem = rem - od;
  if (rem % 2) {
    cout << "NO" << '\n';
    return;
  }
  ind = 0;
  for (int j = p - 1, i = 0; i < max(0, ev - (int)even.size()); i++, j--) {
    ans[j].push_back(odd[ind++]);
    ans[j].push_back(odd[ind++]);
  }
  for (int i = p; i < k; i++) ans[i].push_back(odd[ind++]);
  for (; ind < (int)odd.size(); ind++) {
    ans[0].push_back(odd[ind]);
  }
  cout << "YES" << '\n';
  for (int i = 0; i < k; i++) {
    cout << (int)ans[i].size() << " ";
    for (int j : ans[i]) cout << j << " ";
    cout << '\n';
  }
}
int main() {
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(20);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) {
    solve();
  }
}