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>
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, -1, 1};
long long mod = 1e9 + 7;
bool vis[100000];
using namespace std;
bool isPrime(long long n) {
  long long j;
  for (j = 2; j <= sqrt(n); j++) {
    if (n % j == 0) {
      break;
    }
  }
  if (j > sqrt(n)) {
    return 1;
  } else {
    return 0;
  }
}
long long modexpo(long long a, long long b) {
  long long ans = 1;
  a = a % mod;
  while (b > 0) {
    if ((b & 1) == 1) {
      ans = ((ans % mod) * (a % mod)) % mod;
    }
    b = b >> 1;
    a = ((a % mod) * (a % mod)) % mod;
  }
  return ans;
}
long long invmod(long long n) { return modexpo(n, mod - 2); }
long long comb(long long n, long long r) {
  if (r == 0) {
    return 1;
  }
  long long fact[n + 1];
  fact[0] = 1;
  for (long long i = 1; i <= n; i++) {
    fact[i] = (fact[i - 1] * i) % mod;
  }
  return (fact[n] * invmod(fact[r]) % mod * invmod(fact[n - r]) % mod) % mod;
}
long long gcd(long long a, long long b) {
  if (a == 0) {
    return b;
  }
  return gcd(b % a, a);
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
void dfs(long long i, vector<long long> adj[], bool visited[]) {
  visited[i] = 1;
  for (auto j : adj[i]) {
    if (visited[j] == 0) {
      dfs(j, adj, visited);
    }
  }
}
bool sortbysecdesc(const pair<int, int> &a, const pair<int, int> &b) {
  return a.second > b.second;
}
void solve(long long k) {
  long long n, d, p;
  cin >> n >> d >> p;
  long long a[n];
  vector<long long> ev, od, ans1[p + 1], ans2[d - p + 1];
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
    if (a[i] % 2) {
      od.push_back(a[i]);
    } else {
      ev.push_back(a[i]);
    }
  }
  if ((d - p) > od.size()) {
    cout << "NO"
         << "\n";
    return;
  }
  long long j = 0, f = 1;
  for (long long i = 0; i < p; i++) {
    if (j < ev.size()) {
      ans1[i].push_back(ev[j]);
      j++;
    } else if (f < od.size()) {
      ans1[i].push_back(od[f - 1]);
      ans1[i].push_back(od[f]);
      f += 2;
    } else {
      cout << "NO"
           << "\n";
      return;
    }
  }
  f--;
  for (long long i = 0; i < (d - p); i++) {
    if (f < od.size()) {
      ans2[i].push_back(od[f]);
      f++;
    } else {
      cout << "NO"
           << "\n";
      return;
    }
  }
  if ((d - p) > 0) {
    f++;
    while (f < od.size()) {
      ans2[0].push_back(od[f - 1]);
      ans2[0].push_back(od[f]);
      f += 2;
    }
  } else {
    f++;
    while (f < od.size()) {
      ans1[0].push_back(od[f - 1]);
      ans1[0].push_back(od[f]);
      f += 2;
    }
  }
  if (f == od.size()) {
    cout << "NO"
         << "\n";
    return;
  }
  if (p != 0) {
    while (j < ev.size()) {
      ans1[0].push_back(ev[j]);
      j++;
    }
  } else {
    while (j < ev.size()) {
      ans2[0].push_back(ev[j]);
      j++;
    }
  }
  cout << "YES"
       << "\n";
  for (long long i = 0; i < p; i++) {
    cout << ans1[i].size() << " ";
    for (auto h : ans1[i]) {
      cout << h << " ";
    }
    cout << "\n";
  }
  for (long long i = 0; i < (d - p); i++) {
    cout << ans2[i].size() << " ";
    for (auto h : ans2[i]) {
      cout << h << " ";
    }
    cout << "\n";
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t = 1;
  long long k = 1;
  while (k <= t) {
    solve(k);
    k++;
  }
  return 0;
}