{"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":"MD","content":"544想要防AK,翻出了这个去年多校的垃圾题,他有一个正整数n,想要把这个数变漂亮,所以他想交换k个位置的数让它变漂亮\n544可以交换n中两个数位(xi and xj (1≤i≤j≤m))只要交换后n无前导0,你能求出交换k位后n的最大可能值和最小可能值吗。"}},{"title":"Input","value":{"format":"MD","content":"第一行包含一个整数T,表示测试用例的数量。\n下面的每T行描述一个测试用例,并包含两个空格分隔的整数n和k。\n1≤T≤100, 1≤n, k≤1e9"}},{"title":"Output","value":{"format":"MD","content":"对于每个测试用例,在一行中打印由一个空格分隔的n可能的最小整数和最大整数。"}},{"title":"Sample Input","value":{"format":"MD","content":"\u003cpre\u003e5\n12 1\n213 2\n998244353 1\n998244353 2\n998244353 3\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"MD","content":"\u003cpre\u003e12 21\n123 321\n298944353 998544323\n238944359 998544332\n233944859 998544332\u003c/pre\u003e"}}]}