{"trustable":true,"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":"\u003cp\u003eVocê recebe uma string $$$t$$$ consistindo de $$$n$$$ letras minúsculas latinas e um número inteiro $$$k$$$.\u003c/p\u003e\u003cp\u003eVamos definir uma substring de alguma string $$$s$$$ com índices de $$$l$$$ a $$$r$$$ como $$$s[l \\dots r]$$$.\u003c/p\u003e\u003cp\u003eSua tarefa é construir uma string $$$s$$$ de comprimento mínimo possível de forma que haja exatamente $$$k$$$ posições $$$i$$$ tais que $$$s[i \\dots i + n - 1] \u003d t$$$. Em outras palavras, sua tarefa é construir uma string $$$s$$$ de comprimento mínimo possível de forma que haja exatamente $$$k$$$ substrings de $$$s$$$ iguais a $$$t$$$.\u003c/p\u003e\u003cp\u003eÉ garantido que a resposta é sempre única.\u003c/p\u003e"}},{"title":"Entrada","value":{"format":"HTML","content":"\u003cp\u003eA primeira linha da entrada contém dois inteiros $$$n$$$ e $$$k$$$ ($$$1 \\le n, k \\le 50$$$) — o comprimento da string $$$t$$$ e o número de substrings.\u003c/p\u003e\u003cp\u003eA segunda linha da entrada contém a string $$$t$$$ consistindo exatamente de $$$n$$$ letras minúsculas latinas.\u003c/p\u003e"}},{"title":"Saída","value":{"format":"HTML","content":"\u003cp\u003eImprima uma string $$$s$$$ de comprimento mínimo possível de forma que haja exatamente $$$k$$$ substrings de $$$s$$$ iguais a $$$t$$$.\u003c/p\u003e\u003cp\u003eÉ garantido que a resposta é sempre única.\u003c/p\u003e"}},{"title":"Exemplos","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\u003e3 4\naba\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eababababa\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e"}},{"title":"","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\u003e3 2\ncat\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003ecatcat\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e"}}]}