ORST

You are given arrays $A$ and $B$ of sizes $N$ and $M$ respectively, such that $1\le B_i \le N$. For each $1\le i \le M$: - Sort the suffix of length $B_i$ in array $A$ in non-decreasing order. Output the resultant array $A$ after all operations. Note that a suffix of length $X$ denotes the subarray consisting of last $X$ elements of the array. ### Input - The first line consists of a single in