I Hate Symbo-LIS-m

The longest increasing subsequence (LIS) of a sequence $B_1, B_2, \ldots, B_L$ is the longest sequence of valid indices $i_1, i_2, \ldots, i_k$ such that $i_1 \lt i_2 \lt \ldots \lt i_k$ and $B_{i_1} \lt B_{i_2} \lt \ldots \lt B_{i_k}$. You are given a sequence $A_1, A_2, \ldots, A_N$. You may modify it by performing the following operation zero or more times: - Let $K$ be the length of the LI