{"problem":{"name":"Permutation Division","description":{"content":"You are given a permutation $P$ of $1, 2, \\cdots, N$. You can divide $P$ into exactly $K$ non-empty contiguous subsequences as you like. Maroon will rearrange those subsequences you make and concatena","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"arc114_f"},"statements":[{"statement_type":"Markdown","content":"You are given a permutation $P$ of $1, 2, \\cdots, N$.\nYou can divide $P$ into exactly $K$ non-empty contiguous subsequences as you like.\nMaroon will rearrange those subsequences you make and concatenate them to make a new permutation $Q$. Here, he will lexicographically maximize $Q$.\nYou want to divide $P$ in a way that lexicographically minimizes $Q$. Find $Q$ in that case.\n\n## Constraints\n\n*   $1 \\leq N \\leq 2 \\times 10^5$\n*   $1 \\leq K \\leq N$\n*   $1 \\leq P_i \\leq N$\n*   $P_i \\neq P_j (i \\neq j)$\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $K$\n$P_1$ $P_2$ $\\cdots$ $P_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"arc114_f","tags":[],"sample_group":[["3 2\n1 2 3","2 3 1\n\nYou have two ways to divide $P$: $(1, 2),(3)$ and $(1), (2, 3)$.\nIn the former case, Maroon will rearrange them in the order $(3), (1, 2)$ to get $Q = (3, 1, 2)$.\nIn the latter case, Maroon will rearrange them in the order $(2, 3), (1)$ to get $Q = (2, 3, 1)$.\nThus, you should choose the latter."],["4 3\n4 3 1 2","4 3 1 2"],["20 7\n10 5 8 2 1 9 12 20 15 3 7 6 19 4 11 17 13 14 16 18","10 5 8 2 7 6 19 4 11 17 13 14 16 18 3 1 9 12 20 15"]],"created_at":"2026-03-03 11:01:14"}}