Maximize Deletions

Let’s define an operation $\bf{deletion}$ for an array `nums` of length $N$, as the removal of $i^{th}$ number in `nums` and concatenating the remaining elements without changing their order, such that $0 \leq i \lt N$. **Note** that after performing this operation, index of elements in `nums` does not change. You are given two lists of integers $A$ and $B$ of length $N$ and $M$ respectively. I