This is a run-twice (communication) problem. There are two players: Player A (Agent) and Player B (Blackslex). The jury will first interact with player A. After player A ends their interaction, the jury will interact with player B. Note that player A and player B may not directly pass information to each other; both players are only able to send information or receive information from the jury, but they may agree on the strategy they will use to communicate. The Penguin Republic is a bipartite connected undirected graph (G) with (n) vertices and (m) edges. Blackslex is going to conduct forbidden field research at vertex (1). Due to travel restrictions, he will be dropped off at an unknown vertex (v) ((2 \leq v \leq n)). He must get to vertex (1) while having no information on the graph. For his journey, he has bribed a penguin agent and agreed to some communication strategy using the following method; the agent will discreetly mark each vertex in one of the three colors: red, green, or blue. From Blackslex's perspective, he will see only the color (c_i) of each neighbor (u_i) ((1 \leq i \leq d(v))(^{\text{∗}})) of (v). He must choose some (j) ((1 \leq j \leq d(v))) and move to vertex (u_j) such that he is closer to vertex (1). Note that the neighbors are arbitrarily ordered. He sees only the colors of the neighboring vertices, and not the vertex that he is on. Additionally, he does not know the index of the vertex he's on, the neighboring vertices, or any other vertex. Your task is to implement the strategy for both the agent and Blackslex. For the agent, you must color each vertex in one of the three colors. For Blackslex, you are given (q) queries. In each query, you are dropped off at an arbitrary and unknown vertex (v) and given the color of the neighboring vertices. You must determine a vertex to go to such that you are closer to vertex (1). (^{\text{∗}})The number of neig