{"trustable":false,"prependHtml":"\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eYou have to recover an array of $n$ positive integers. You have $m$ pieces of information. Each information tells you a range $[l,r]$, meaning the array values $a_l,a_{l+1},\\ldots,a_{r-1},a_r$ are all pairwise distinct. Recover the array satisfying these constraints. \u003c/p\u003e\n\n\u003cp\u003eWhat if there are many such arrays? You guessed it, find the lexicographically smallest one. \u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eThe first line contains integer $T$, denoting the number of test cases. \u003c/p\u003e\n\n\u003cp\u003e In each test, first line contains two integers $n$ and $m$ ($1 \\le n, m \\le 10^5$). They denote the length of the array and the number of pieces of information. Next $m$ lines contain two integers $l_i$ and $r_i$ ($1 \\le l_i \\le r_i \\le n$) each.\u003c/p\u003e\n\u003cp\u003e\nIt is guaranteed that both the sum of all $n$ and the sum of all $m$ are at most $10^6$.\n\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"For each test case, output $n$ integers denoting the lexicographically smallest array. Integers should be separated by a single space, and no extra spaces are allowed at the end of lines.\n\u003cbr\u003e"}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e\u003cpre\u003e3\n2 1\n1 2\n4 2\n1 2\n3 4\n5 2\n1 3\n2 4\n\u003c/pre\u003e\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e\u003cpre\u003e1 2\n1 2 1 2\n1 2 3 1 1\n\u003c/pre\u003e\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}