AT_abc478_c [ABC478C] Sort Subarray

You are given a length- $ N $ integer sequence $ A=(A _ 1,A _ 2,\ldots,A _ N) $ . You will perform the following operation on $ A $ **exactly once**. - Choose an integer $ i $ between $ 1 $ and $ N-K+1 $ , inclusive. Sort $ A _ i,A _ {i+1},\ldots,A _ {i+K-1} $ in ascending order. More formally, let $ B _ 1,B _ 2,\ldots,B _ K $ be $ A _ i,A _ {i+1},\ldots,A _ {i+K-1} $ arranged in increasing order, and simultaneously replace $ A _ {i+j-1} $ with $ B _ j $ for $ 1\le j\le K $ . Determine whether it is possible that, after this operation, $ A $ is in ascending order, that is, $ A _ i\le A _ {i+1} $ holds for all $ 1\le i\lt N $ .

The input is given from Standard Input in the following format: > $ N $ $ K $ $ A _ 1 $ $ A _ 2 $ $ \ldots $ $ A _ N $

If $ A $ can be sorted in ascending order by performing the operation once, output `Yes`; otherwise, output `No`.

### Sample Explanation 1 For example, if you choose $ 2 $ as $ i $ , then $ (A _ 2,A _ 3,A _ 4,A _ 5,A _ 6,A _ 7)=(4,1,4,2,1,3) $ is replaced with $ (1,1,2,3,4,4) $ . After the operation, $ A $ is $ (1,1,1,2,3,4,4,5,6) $ , which satisfies the condition. Thus, output `Yes`. ### Sample Explanation 2 $ K=1 $ , so $ A $ does not change regardless of which $ i $ the operation is performed on. Thus, output `No`. ### Constraints - $ 1\le K\lt N\le2\times10 ^ 5 $ - $ 1\le A _ i\le N\ (1\le i\le N) $ - All input values are integers.