{"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\u003eTheofanis has a string $$$s_1 s_2 \\dots s_n$$$ and a character $$$c$$$. He wants to make all characters of the string equal to $$$c$$$ using the minimum number of operations.\u003c/p\u003e\u003cp\u003eIn one operation he can choose a number $$$x$$$ ($$$1 \\le x \\le n$$$) and \u003cspan class\u003d\"tex-font-style-bf\"\u003efor every position $$$i$$$\u003c/span\u003e, where $$$i$$$ is \u003cspan class\u003d\"tex-font-style-bf\"\u003enot\u003c/span\u003e divisible by $$$x$$$, replace $$$s_i$$$ with $$$c$$$. \u003c/p\u003e\u003cp\u003eFind the minimum number of operations required to make all the characters equal to $$$c$$$ and the $$$x$$$-s that he should use in his operations.\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eThe first line contains a single integer $$$t$$$ ($$$1 \\le t \\le 10^4$$$)\u0026nbsp;— the number of test cases.\u003c/p\u003e\u003cp\u003eThe first line of each test case contains the integer $$$n$$$ ($$$3 \\le n \\le 3 \\cdot 10^5$$$) and a lowercase Latin letter $$$c$$$\u0026nbsp;— the length of the string $$$s$$$ and the character the resulting string should consist of.\u003c/p\u003e\u003cp\u003eThe second line of each test case contains a string $$$s$$$ of lowercase Latin letters\u0026nbsp;— the initial string.\u003c/p\u003e\u003cp\u003eIt is guaranteed that the sum of $$$n$$$ over all test cases does not exceed $$$3 \\cdot 10^5$$$.\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003eFor each test case, firstly print one integer $$$m$$$\u0026nbsp;— the minimum number of operations required to make all the characters equal to $$$c$$$.\u003c/p\u003e\u003cp\u003eNext, print $$$m$$$ integers $$$x_1, x_2, \\dots, x_m$$$ ($$$1 \\le x_j \\le n$$$)\u0026nbsp;— the $$$x$$$-s that should be used in the order they are given.\u003c/p\u003e\u003cp\u003eIt can be proved that under given constraints, an answer always exists. If there are multiple answers, print any.\u003c/p\u003e"}},{"title":"Examples","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\n4 a\naaaa\n4 a\nbaaa\n4 b\nbzyx\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e0\n1\n2\n2 \n2 3\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Note","value":{"format":"HTML","content":"\u003cp\u003eLet\u0027s describe what happens in the third test case: \u003c/p\u003e\u003col\u003e \u003cli\u003e $$$x_1 \u003d 2$$$: we choose all positions that are not divisible by $$$2$$$ and replace them, i.\u0026nbsp;e. \u003cspan class\u003d\"tex-font-style-tt\"\u003e\u003cspan class\u003d\"tex-font-style-underline\"\u003eb\u003c/span\u003ez\u003cspan class\u003d\"tex-font-style-underline\"\u003ey\u003c/span\u003ex\u003c/span\u003e $$$\\rightarrow$$$ \u003cspan class\u003d\"tex-font-style-tt\"\u003ebzbx\u003c/span\u003e; \u003c/li\u003e\u003cli\u003e $$$x_2 \u003d 3$$$: we choose all positions that are not divisible by $$$3$$$ and replace them, i.\u0026nbsp;e. \u003cspan class\u003d\"tex-font-style-tt\"\u003e\u003cspan class\u003d\"tex-font-style-underline\"\u003ebz\u003c/span\u003eb\u003cspan class\u003d\"tex-font-style-underline\"\u003ex\u003c/span\u003e\u003c/span\u003e $$$\\rightarrow$$$ \u003cspan class\u003d\"tex-font-style-tt\"\u003ebbbb\u003c/span\u003e. \u003c/li\u003e\u003c/ol\u003e"}}]}