{"trustable":false,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\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 type\u003d\"text/javascript\" async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS_HTML-full\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"MD","content":"给你一个长度为n的字符串t和一个整数k,请你构造出来一个长度最短的字符串s,使得这个s中恰好有k个位置i,满足s[i..i+n-1]\u003dt,即s中出现了k次的子串t.\u003cbr\u003e"}},{"title":"Input","value":{"format":"MD","content":"输入的第一行包含两个整数n,k(1\u003c\u003dn,k\u003c\u003d50).\u003cbr\u003e\n第二行输入一个长度为n的字符串t"}},{"title":"Output","value":{"format":"MD","content":"输出最短的符合要求的字符串s,保证这样的字符串唯一"}},{"title":"Examples","value":{"format":"MD","content":"样例输入:\n3 4\ncbc\n样例输出\ncbcbcbcbc"}}]}