The package for this problem was not updated by the problem writer or Codeforces administration after we've upgraded the judging servers. To adjust the time limit constraint, a solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then the value 800 ms will be displayed and used to determine the verdict.

VK Cup 2012 Round 3 |
---|

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.

dfs and similar

graphs

*1700

No tag edit access

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

×
A. Variable, or There and Back Again

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputLife is not easy for the perfectly common variable named Vasya. Wherever it goes, it is either assigned a value, or simply ignored, or is being used!

Vasya's life goes in states of a program. In each state, Vasya can either be used (for example, to calculate the value of another variable), or be assigned a value, or ignored. Between some states are directed (oriented) transitions.

A path is a sequence of states *v*_{1}, *v*_{2}, ..., *v*_{x}, where for any 1 ≤ *i* < *x* exists a transition from *v*_{i} to *v*_{i + 1}.

Vasya's value in state *v* is interesting to the world, if exists path *p*_{1}, *p*_{2}, ..., *p*_{k} such, that *p*_{i} = *v* for some *i* (1 ≤ *i* ≤ *k*), in state *p*_{1} Vasya gets assigned a value, in state *p*_{k} Vasya is used and there is no state *p*_{i} (except for *p*_{1}) where Vasya gets assigned a value.

Help Vasya, find the states in which Vasya's value is interesting to the world.

Input

The first line contains two space-separated integers *n* and *m* (1 ≤ *n*, *m* ≤ 10^{5}) — the numbers of states and transitions, correspondingly.

The second line contains space-separated *n* integers *f*_{1}, *f*_{2}, ..., *f*_{n} (0 ≤ *f*_{i} ≤ 2), *f*_{i} described actions performed upon Vasya in state *i*: 0 represents ignoring, 1 — assigning a value, 2 — using.

Next *m* lines contain space-separated pairs of integers *a*_{i}, *b*_{i} (1 ≤ *a*_{i}, *b*_{i} ≤ *n*, *a*_{i} ≠ *b*_{i}), each pair represents the transition from the state number *a*_{i} to the state number *b*_{i}. Between two states can be any number of transitions.

Output

Print *n* integers *r*_{1}, *r*_{2}, ..., *r*_{n}, separated by spaces or new lines. Number *r*_{i} should equal 1, if Vasya's value in state *i* is interesting to the world and otherwise, it should equal 0. The states are numbered from 1 to *n* in the order, in which they are described in the input.

Examples

Input

4 3

1 0 0 2

1 2

2 3

3 4

Output

1

1

1

1

Input

3 1

1 0 2

1 3

Output

1

0

1

Input

3 1

2 0 1

1 3

Output

0

0

0

Note

In the first sample the program states can be used to make the only path in which the value of Vasya interests the world, 1 2 3 4; it includes all the states, so in all of them Vasya's value is interesting to the world.

The second sample the only path in which Vasya's value is interesting to the world is , — 1 3; state 2 is not included there.

In the third sample we cannot make from the states any path in which the value of Vasya would be interesting to the world, so the value of Vasya is never interesting to the world.

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Feb/29/2024 01:15:42 (l1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|