{"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":"\u003cscript type\u003d\u0027text/x-mathjax-config\u0027\u003eMathJax.Hub.Config({tex2jax: { inlineMath: [[\u0027$\u0027,\u0027$\u0027]] } }); \u003c/script\u003e\n\u003cscript type\u003d\u0027text/javascript\u0027 src\u003d\u0027https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\u0027\u003e\u003c/script\u003e\n\u003cscript type\u003d\u0027text/javascript\u0027\u003esetTimeout(function(){MathJax.Hub.Queue([\u0027Typeset\u0027, MathJax.Hub, \u0027left_view\u0027]);}, 2000);\u003c/script\u003e\n\u003cdiv class\u003d\"panel_content\"\u003e\n给你一个正整数n,你可以把n的第i位数字与第j位数字进行交换(1 \u003c\u003d i \u003c\u003d j \u003c\u003d n的位数),但是交换过程中不能出现前导零,(例如:11011,第1位和第3位不能交换,因为交换后会出现前导零,输入中保证没有前导零)。现在请你算出经过k次交换后可以得到的最小的整数和最大的整数。\n\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"第一行给你一个整数T,表示样例数。\n\u003cbr\u003e\n每个样例给你两个整数n,k,如题意所示。(1 \u003c\u003d T \u003c\u003d 100 , 1 \u003c\u003d n,k \u003c\u003d 1,000,000,000)"}},{"title":"Output","value":{"format":"HTML","content":"\n对于每个样例,输出两个由空格分隔的整数,表示经过k次交换后可以得到的最小的整数和最大的整数。"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre\u003e5\n12 1\n213 2\n998244353 1\n998244353 2\n998244353 3\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre\u003e12 21\n123 321\n298944353 998544323\n238944359 998544332\n233944859 998544332\u003c/pre\u003e"}}]}