#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100010;
int n, a, b, t;
pair<int, int> m[MAXN];
bool ans[MAXN];
int main() {
  cin >> n >> a >> b;
  for (int i = 0; i < n; i++) {
    scanf("%d", &m[i].first);
    m[i].second = i;
    if (a < b) m[i].second *= -1;
  }
  if (a != b) sort(m, m + n);
  for (int i = 0; i < (a < b ? b : a); i++)
    if (a < b)
      ans[a < b ? -m[i].second : m[i].second] = true;
    else
      ans[a < b ? -m[i].second : m[i].second] = true;
  for (int i = 0; i < n; i++)
    printf("%d ", ((a >= b) ? (ans[i] ? 1 : 2) : (ans[i] ? 2 : 1)));
  return 0;
}
