1
+ #include < cstdio>
2
+ #include < cstring>
3
+ #include < cmath>
4
+ #include < ctime>
5
+ #include < vector>
6
+ #include < string>
7
+ #include < algorithm>
8
+ #include < map>
9
+ #include < set>
10
+ #include < unordered_map>
11
+ #include < unordered_set>
12
+ #include < queue>
13
+ #include < deque>
14
+ #include < stack>
15
+ #include < numeric>
16
+ #include < memory>
17
+ using namespace std ;
18
+
19
+ #define PB push_back
20
+ #define F first
21
+ #define S second
22
+
23
+ #define REP (i,from,to ) for (auto i=(from); i<=(to); ++i)
24
+ #define PER (i,from,to ) for (auto i=(from); i>=(to); --i)
25
+ #define REP_IF (i,from,to,assert ) for (auto i=(from); i<=(to); ++i) if (assert)
26
+
27
+ #define FOR (i,less_than ) for (auto i=0 ; i<(less_than); ++i)
28
+ #define FORI (i, container ) for (auto i=0 ; i<(container).size(); ++i)
29
+ #define FORI_IF (i, container, assert ) for (auto i=0 ; i<(container).size(); ++i) if (assert)
30
+ #define ROFI (i, container ) for (auto i=(container).size()-1 ; i>=0 ; --i)
31
+
32
+ #define FOREACH (elem, container ) for (auto elem : (container))
33
+ #define FILL (container, value ) memset(container, value, sizeof (container))
34
+ #define ALL (container ) (container).begin(), (container).end()
35
+ #define SZ (container ) (int )((container).size())
36
+
37
+ #define BACK (set_map ) *prev ((set_map).end(), 1)
38
+ #define FRONT (set_map ) *(set_map).begin()
39
+
40
+ inline void _RD (int &x) { scanf (" %d" , &x); }
41
+ inline void _RD (long long &x) { scanf (" %lld" , &x); }
42
+ inline void _RD (double &x) { scanf (" %lf" , &x); }
43
+ inline void _RD (long double &x) { scanf (" %Lf" , &x); }
44
+ inline void _RD (char &x) { scanf (" %c" , &x); }
45
+ inline void RD () {}
46
+ template <class T , class ... U>
47
+ inline void RD (T &head, U &... tail) { _RD (head); RD (tail...); }
48
+
49
+ using PII = pair<int ,int >;
50
+ using LL = long long ;
51
+ using VI = vector<int >;
52
+ using VLL = vector<LL>;
53
+ using VVI = vector<VI>;
54
+
55
+ int main () {
56
+
57
+ int n, a, b;
58
+ RD (n, a, b);
59
+
60
+ VI ans (n+1 , 2 );
61
+ int x;
62
+ REP (i, 1 , a) {
63
+ RD (x);
64
+ ans[x] = 1 ;
65
+ }
66
+
67
+ REP (i, 1 , n)
68
+ printf (" %d " , ans[i]);
69
+ printf (" \n " );
70
+
71
+ return 0 ;
72
+ }
0 commit comments