Friendship Graph

Friendship between two people is usually mutual, but not always.

If person $A$ trusts person $B$, the friendship graph $G$ has a directed edge $A \to B$. $G$ can contain $A \to B$ without containing $B \to A$.

Person $X$ wants to deliver a secret message to another person $Y$, either directly or by passing it along a chain of trusted friendships in $G$. The message gets through exactly when you can start at $X$, follow edges in their direction, and arrive at $Y$.

You are given $Q$ queries, each with its own $X$ and $Y$. Decide for every query whether the message gets through.

The input has two parts. The first part is the friendship graph $G$ and the second part is the queries, separated by a blank line for clarity.

The first line contains two integers $V$ and $E$. ($1 \le V \le 2000$, $0 \le E \le 100000$)

Each of the next $E$ lines contains two integers $A$ and $B$, meaning $G$ has the directed edge $A \to B$. Vertices are numbered from $0$ to $V-1$, so $0 \le A, B < V$.

The next line contains the number of queries $Q$. ($1 \le Q \le 200000$)

Each of the next $Q$ lines contains two integers $X$ and $Y$. ($0 \le X, Y < V$) A query with $X = Y$ can appear.

Print one line per query. Print 1 if the message from $X$ reaches $Y$, and 0 if it does not. If $X = Y$, print 1.