{"problem":{"name":"Monotonically Increasing","description":{"content":"Print all strictly increasing integer sequences of length $N$ where all elements are between $1$ and $M$ (inclusive), in lexicographically ascending order.","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc263_c"},"statements":[{"statement_type":"Markdown","content":"Print all strictly increasing integer sequences of length $N$ where all elements are between $1$ and $M$ (inclusive), in lexicographically ascending order.\n\n## Constraints\n\n*   $1 \\le N \\le M \\le 10$\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $M$\n\n[samples]\n\n## Notes\n\nFor two integer sequences of the same length $A_1,A_2,\\dots,A_N$ and $B_1,B_2,\\dots,B_N$, $A$ is said to be lexicographically earlier than $B$ if and only if:\n\n*   there is an integer $i$ $(1 \\le i \\le N)$ such that $A_j=B_j$ for all integers $j$ satisfying $1 \\le j < i$, and $A_i < B_i$.\n\nAn integer sequence $A_1,A_2,\\dots,A_N$ is said to be strictly increasing if and only if:\n\n*   $A_i < A_{i+1}$ for all integers $i$ $(1 \\le i \\le N-1)$.","is_translate":false,"language":"English"}],"meta":{"iden":"abc263_c","tags":[],"sample_group":[["2 3","1 2 \n1 3 \n2 3 \n\nThe sought sequences are $(1,2),(1,3),(2,3)$, which should be printed in lexicographically ascending order."],["3 5","1 2 3 \n1 2 4 \n1 2 5 \n1 3 4 \n1 3 5 \n1 4 5 \n2 3 4 \n2 3 5 \n2 4 5 \n3 4 5"]],"created_at":"2026-03-03 11:01:14"}}