Restricted Removals

You are given two **binary** arrays $A$ and $B$, of lengths $N$ and $M$, respectively. You can perform the following operation: - Choose an index $i$ ($1 \leq i \leq \min(|A|, M)$) such that $A_i = B_i$. Here, $|A|$ denotes the current length of $A$. - Delete $A_i$ from $A$. This reduces the length of $A$ by $1$. - Then, re-index the remaining elements of $A$ to start from $1$, without changing