{"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":"HTML","content":"Sakib Al Hasan is given a string \u003cb\u003et\u003c/b\u003e consisting of \u003cb\u003en\u003c/b\u003e lowercase letters and an integer number \u003cb\u003ek\u003c/b\u003e. \u003cbr\u003e\u003cbr\u003e\n\nA substring is a contiguous sequence of characters within a string. Let\u0027s think of some substring of a string \u003cb\u003es\u003c/b\u003e with indices from \u003cb\u003el\u003c/b\u003e to \u003cb\u003er\u003c/b\u003e as \u003cb\u003es[l…r]\u003c/b\u003e.\u003cbr\u003e\u003cbr\u003e\n\nYour task is to help Sakib Al Hasan constructing such string \u003cb\u003es\u003c/b\u003e of minimum possible length that there are exactly \u003cb\u003ek\u003c/b\u003e positions \u003cb\u003ei\u003c/b\u003e such that \u003cb\u003es[i…i+n−1]\u003dt\u003c/b\u003e. In other words, your task is to construct such string \u003cb\u003es\u003c/b\u003e of minimum possible length that there are exactly \u003cb\u003ek\u003c/b\u003e substrings of \u003cb\u003es\u003c/b\u003e equal to \u003cb\u003et\u003c/b\u003e.\n"}},{"title":"Input","value":{"format":"HTML","content":"The first line of the input contains two integers \u003cb\u003en\u003c/b\u003e and \u003cb\u003ek (1≤n,k≤50)\u003c/b\u003e — the length of Sakib Al Hasan\u0027s string \u003cb\u003et\u003c/b\u003e and the number of substrings.\u003cbr\u003e\u003cbr\u003e\n\nThe second line of the input contains Sakib Al Hasan\u0027s string \u003cb\u003et\u003c/b\u003e consisting of exactly \u003cb\u003en\u003c/b\u003e lowercase Latin letters."}},{"title":"Output","value":{"format":"HTML","content":"Print such string \u003cb\u003es\u003c/b\u003e of minimum possible length that there are exactly \u003cb\u003ek\u003c/b\u003e substrings of \u003cb\u003es\u003c/b\u003e equal to \u003cb\u003et\u003c/b\u003e.\n\u003cbr\u003e\u003cbr\u003e\nIt is guaranteed that the answer is always unique."}},{"title":"Examples","value":{"format":"HTML","content":" \u003cb\u003eInput 1\u003c/b\u003e\u003cbr\u003e\n 3 4\u003cbr\u003eaba\u003cbr\u003e\n \u003cb\u003eOutput 1\u003c/b\u003e \u003cbr\u003e\n ababababa\u003cbr\u003e \u003cbe\u003e\n\u003chr\u003e\n \u003cb\u003eInput 2\u003c/b\u003e \u003cbr\u003e\n 3 2\u003cbr\u003ecat\u003cbr\u003e\n \u003cb\u003eOutput 2\u003c/b\u003e\u003cbr\u003e\n catcat\u003cbr\u003e"}}]}