If you pass the previous trial of Devil Aguin, congratulations to you! But the real trial has just begun. This time, Devil Aguin provides you a sequence $A$ consisting of $n$ elements and a value $k$. Then he also offers you an operation to process the sequence.
What you can do in one operation are as following :
-
Select a $k$-length interval of $A$ arbitrarily.
-
Select a positive integer $x$ arbitrarily.
-
Turn element whose value is no more than $x$ in the interval to $0$.
You can perform the operation as much as you like. It is clear that, when you perform the operation, the elements in $A$ may be developed into $0$ one by one. Now Devil Aguin gives you an order sequence $C$, which contains $m$ elements ranging from $1$ to $n$. He requires that for each $x(1 \leq x \leq m)$, the $C_{x}$-th element in $A$ must turn to $0$. And generally, for every $i,j(i<j)$, the time $C_{i}$-th element in $A$ turning to $0$ must be strictly earlier than $C_{j}$-th element.
Please judge if it is possible to meet the requirement.
It is guaranteed that there is no same element in $C$.
