There are ~n~ attractions in Baku, numbered from ~0~ to ~n-1~. There are also ~m~ two-way roads, numbered from ~0~ to ~m-1~. Each road connects two different attractions. It is possible to travel between any pair of attractions through the roads.

Fatima is planning to visit all of the attractions in three days. She already decided that she wants to visit ~a~ attractions on the first day, ~b~ attractions on the second day, and ~c~ attractions on the third day. Therefore, she is going to partition the ~n~ attractions into three sets ~A~, ~B~, and ~C~ of sizes ~a~, ~b~, and ~c~, respectively. Each attraction will belong to exactly one set, so ~a+b+c = n~.

Fatima would like to find the sets ~A~, ~B~, and ~C~, so that at least two out of the three sets are connected. A set of attractions is called connected if it is possible to travel between any pair of attractions in ~S~ by using the roads and without passing through any attraction not in ~S~. A partition of attractions into sets ~A~, ~B~, and ~C~ is called valid if it satisfies the conditions described above.

Help Fatima find a valid partition of the attractions (given ~a~, ~b~, and ~c~), or determine that no valid partition exists. If there are multiple valid partitions, you may find any of them.

Implementation details

You should implement the following procedure:

std::vector<int> find_split(int n, int a, int b, int c, std::vector<int> p, std::vector<int> q)

• ~n~: the number of attractions.
• ~a~, ~b~, and ~c~: the desired sizes of sets ~A~, ~B~, and ~C~.
• ~p~ and ~q~: arrays of length ~m~, containing the endpoints of the roads. For each ~i~ ~(0 \le i \le m-1)~, ~p[i]~ and ~q[i]~ are the two attractions connected by road ~i~.
• This procedure should return an array of length ~n~. Denote the array by ~s~. If there is no valid partition, ~s~ should contain ~n~ zeros. Otherwise, for ~0 \le i \le n-1~, ~s[i]~ should be one of ~1~, ~2~, or ~3~ to denote that attraction ~i~ is assigned to set ~A~, ~B~, or ~C~, respectively.

Examples

Example 1

Consider the following call:

find_split(9, 4, 2, 3, {0, 0, 0, 0, 0, 0, 1, 3, 4, 5}, {1, 2, 3, 4, 6, 8, 7, 7, 5, 6})

A possible correct solution is ~[1,1,3,1,2,2,3,1,3]~. This solution describes the following partition: ~A = \{0,1,3,7\}~, ~B = \{4,5\}~, and ~C = \{2,6,8\}~. The sets ~A~ and ~B~ are connected.

Example 2

Consider the following call:

find_split(6, 2, 2, 2, {0, 0, 0, 0, 0}, {1, 2, 3, 4, 5})

No valid partition exists. Therefore, the only correct answer is ~[0,0,0,0,0,0]~.

Constraints

• ~3 \le n \le 100\,000~
• ~2 \le m \le 200\,000~
• ~1 \le a, b, c \le n~
• ~a+b+c = n~
• There is at most one road between each pair of attractions.
• It is possible to travel between any pair of attractions through the roads.
• ~0 \le p[i], q[i] \le n-1~ and ~p[i] \neq q[i]~ for ~0 \le i \le m-1~

Subtasks

1. (~7~ points) Each attraction is an endpoint of at most two roads.
2. (~11~ points) ~a = 1~
3. (~22~ points) ~m = n-1~
4. (~24~ points) ~n \le 2\,500~, ~m \le 5\,000~
5. (~36~ points) No additional constraints.

Sample grader

The sample grader reads the input in the following format:

• line ~1~: ~n \ m~
• line ~2~: ~a \ b \ c~
• line ~3+i~ (for ~0 \le i \le m-1~): ~p[i] \ q[i]~

The sample grader prints a single line containing the array returned by find_split.