Codeforces Round 366 (Div. 1) |
---|

Finished |

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

flows

greedy

*3100

No tag edit access

The problem statement has recently been changed. View the changes.

×
D. Captain America

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputSteve Rogers is fascinated with new vibranium shields S.H.I.E.L.D gave him. They're all uncolored. There are *n* shields in total, the *i*-th shield is located at point (*x*_{i}, *y*_{i}) of the coordinate plane. It's possible that two or more shields share the same location.

Steve wants to paint all these shields. He paints each shield in either red or blue. Painting a shield in red costs *r* dollars while painting it in blue costs *b* dollars.

Additionally, there are *m* constraints Steve wants to be satisfied. The *i*-th constraint is provided by three integers *t*_{i}, *l*_{i} and *d*_{i}:

- If
*t*_{i}= 1, then the absolute difference between the number of red and blue shields on line*x*=*l*_{i}should not exceed*d*_{i}. - If
*t*_{i}= 2, then the absolute difference between the number of red and blue shields on line*y*=*l*_{i}should not exceed*d*_{i}.

Steve gave you the task of finding the painting that satisfies all the condition and the total cost is minimum.

Input

The first line of the input contains two integers *n* and *m* (1 ≤ *n*, *m* ≤ 100 000) — the number of shields and the number of constraints respectively.

The second line contains two integers *r* and *b* (1 ≤ *r*, *b* ≤ 10^{9}).

The next *n* lines contain the shields coordinates. The *i*-th of these lines contains two integers *x*_{i} and *y*_{i} (1 ≤ *x*_{i}, *y*_{i} ≤ 10^{9}).

The next *m* lines contain the constrains. The *j*-th of these lines contains three integers *t*_{j}, *l*_{j} and *d*_{j} (1 ≤ *t*_{j} ≤ 2, 1 ≤ *l*_{j} ≤ 10^{9}, 0 ≤ *d*_{j} ≤ *n*).

Output

If satisfying all the constraints is impossible print -1 in first and only line of the output.

Otherwise, print the minimum total cost in the first line of output. In the second line print a string of length *n* consisting of letters 'r' and 'b' only. The *i*-th character should be 'r' if the *i*-th shield should be painted red in the optimal answer and 'b' if it should be painted blue. The cost of painting shields in these colors should be equal the minimum cost you printed on the first line.

If there exist more than one optimal solution, print any of them.

Examples

Input

5 6

8 3

2 10

1 5

9 10

9 10

2 8

1 9 1

1 2 1

2 10 3

2 10 2

1 1 1

2 5 2

Output

25

rbrbb

Input

4 4

7 3

10 3

9 8

10 3

2 8

2 8 0

2 8 0

1 2 0

1 9 0

Output

-1

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/03/2023 14:13:55 (l2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|