#include <bits/stdc++.h>
const int N = 1e5 + 10;
const int MOD = 1e9 + 7;
const int INF = 2e9;
const long long INFLL = 1e18;
const double PI = acos((double)-1);
inline int mult(int a, int b, int p = MOD) { return (1ll * a * b) % p; }
inline int add(int a, int b, int p = MOD) { return (1ll * a + b) % p; }
inline int fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
using namespace std;
int n, a, b;
bool check[1000];
int main() {
  ios::sync_with_stdio(false);
  cin >> n >> a >> b;
  memset(check, 0, sizeof(check));
  for (int i = 0; i < a; i++) {
    int x;
    cin >> x;
    check[x] = 1;
  }
  for (int i = 1; i <= n; i++)
    if (check[i])
      cout << 1 << " ";
    else
      cout << 2 << " ";
  return 0;
}
