Yet Another Subsequence Problem

We are given two arrays of equal length $N$, say $A$ and $B$, and we need to find all good subsequence of permutation $(1,2,..,N)$. Consider a **non-empty** subsequence of permutation $(1,2,...,N)$ of length k, $(i_1, i_2, i_3, ..., i_k)$. This subsequence is called good if maximum of all elements in the first array at positions $i_1$, $i_2$, ..., $i_k$ is greater than or equal to maximum of the