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.

No tag edit access

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

×
G. The Tree

time limit per test

3 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputAbendsen assigned a mission to Juliana. In this mission, Juliana has a rooted tree with $$$n$$$ vertices. Vertex number $$$1$$$ is the root of this tree. Each vertex can be either black or white. At first, all vertices are white. Juliana is asked to process $$$q$$$ queries. Each query is one of three types:

- If vertex $$$v$$$ is white, mark it as black; otherwise, perform this operation on all direct sons of $$$v$$$ instead.
- Mark all vertices in the subtree of $$$v$$$ (including $$$v$$$) as white.
- Find the color of the $$$i$$$-th vertex.

Can you help Juliana to process all these queries?

Input

The first line contains two integers $$$n$$$ and $$$q$$$ ($$$2\leq n\leq 10^5$$$, $$$1\leq q\leq 10^5$$$) — the number of vertices and the number of queries.

The second line contains $$$n-1$$$ integers $$$p_2, p_3, \ldots, p_n$$$ ($$$1\leq p_i<i$$$), where $$$p_i$$$ means that there is an edge between vertices $$$i$$$ and $$$p_i$$$.

Each of the next $$$q$$$ lines contains two integers $$$t_i$$$ and $$$v_i$$$ ($$$1\leq t_i\leq 3$$$, $$$1\leq v_i\leq n$$$) — the type of the $$$i$$$-th query and the vertex of the $$$i$$$-th query.

It is guaranteed that the given graph is a tree.

Output

For each query of type $$$3$$$, print "black" if the vertex is black; otherwise, print "white".

Examples

Input

8 10

1 2 1 2 5 4 5

1 2

3 2

3 1

1 1

1 1

3 5

3 7

3 4

2 2

3 5

Output

black

white

black

white

black

white

Input

8 11

1 1 2 3 3 6 6

1 1

1 1

1 3

3 2

3 4

3 6

3 7

2 3

1 6

3 7

3 6

Output

black

white

black

white

white

black

Note

The first example is shown on the picture below.

The second example is shown on the picture below.

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Aug/05/2021 07:31:23 (j2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|