{"problem":{"name":"Minimum Permutation","description":{"content":"We have a sequence $A$ of length $N$ consisting of integers between $1$ and $M$. Here, every integer from $1$ to $M$ appears at least once in $A$. Among the length-$M$ subsequences of $A$ where each o","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc299_g"},"statements":[{"statement_type":"Markdown","content":"We have a sequence $A$ of length $N$ consisting of integers between $1$ and $M$. Here, every integer from $1$ to $M$ appears at least once in $A$.\nAmong the length-$M$ subsequences of $A$ where each of $1, \\ldots, M$ appears once, find the lexicographically smallest one.\n\n## Constraints\n\n*   $1 \\leq M \\leq N \\leq 2 \\times 10^5$\n*   $1 \\leq A_i \\leq M$\n*   Every integer between $1$ and $M$, inclusive, appears at least once in $A$.\n*   All values in the input are integers.\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$N$ $M$\n$A_1$ $A_2$ $\\ldots$ $A_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc299_g","tags":[],"sample_group":[["4 3\n2 3 1 3","2 1 3\n\nThe length-$3$ subsequences of $A$ where each of $1, 2, 3$ appears once are $(2, 3, 1)$ and $(2, 1, 3)$. The lexicographically smaller among them is $(2, 1, 3)$."],["4 4\n2 3 1 4","2 3 1 4"],["20 10\n6 3 8 5 8 10 9 3 6 1 8 3 3 7 4 7 2 7 8 5","3 5 8 10 9 6 1 4 2 7"]],"created_at":"2026-03-03 11:01:14"}}