Magical Subsequence

You are given an array $A = [A_1, A_2, \ldots, A_N]$ containing $N$ elements. You are also given $Q$ **ordered** pairs of integers, where the $i$-th pair is denoted $(x_i, y_i)$. A [subsequence](https://en.wikipedia.org/wiki/Subsequence) of $A$, say $[A_{i_1}, A_{i_2}, \ldots, A_{i_k}]$, is said to be *magical* if the following condition is satisfied: - For each $1 \leq j \lt k$, $(A_{i_j}, A_{i_