{"problem":{"name":"LISDL","description":{"content":"Determine if there exists a sequence obtained by permuting $1,2,...,N$ that satisfies the following conditions: *   The length of its longest increasing subsequence is $A$. *   The length of its long","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"arc091_c"},"statements":[{"statement_type":"Markdown","content":"Determine if there exists a sequence obtained by permuting $1,2,...,N$ that satisfies the following conditions:\n\n*   The length of its longest increasing subsequence is $A$.\n*   The length of its longest decreasing subsequence is $B$.\n\nIf it exists, construct one such sequence.\n\n## Constraints\n\n*   $1 \\leq N,A,B \\leq 3\\times 10^5$\n*   All input values are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $A$ $B$\n\n[samples]\n\n## Notes\n\nA subsequence of a sequence $P$ is a sequence that can be obtained by extracting some of the elements in $P$ without changing the order.\nA longest increasing subsequence of a sequence $P$ is a sequence with the maximum length among the subsequences of $P$ that are monotonically increasing.\nSimilarly, a longest decreasing subsequence of a sequence $P$ is a sequence with the maximum length among the subsequences of $P$ that are monotonically decreasing.","is_translate":false,"language":"English"}],"meta":{"iden":"arc091_c","tags":[],"sample_group":[["5 3 2","2 4 1 5 3\n\nOne longest increasing subsequence of this sequence is ${2,4,5}$, and one longest decreasing subsequence of it is ${4,3}$."],["7 7 1","1 2 3 4 5 6 7"],["300000 300000 300000","\\-1"]],"created_at":"2026-03-03 11:01:14"}}