{"trustable":true,"sections":[{"title":"","value":{"format":"MD","content":"Bob and his girl friend Alice like palindromes very much.\n\nOne day,Bob writes string on a paper.Alice is very excited.So she wants to know can she divide the string into k non-empty palindromes. \n\nBob is very busy.So can you help him?"}},{"title":"Input","value":{"format":"MD","content":"First line is a positive integer T , represents there are T test cases.\n\nFor each test case:\n\nFirst line contains one string consisting of n lowercase English letters(1\u003c\u003dn\u003c\u003d100000)\n\nSecond line contains a number Q(1\u003c\u003dQ\u003c\u003d10),the questions Alice wants to ask.\n\nFollowing Q lines,each lines contains a number k(1\u003c\u003dk\u003c\u003dn),that means Alice wants to know can she divide the string into k non-empty palindromes.\n\nIf she can do it,you should output \"yes\".\n\nIf she can\u0027t do it,you should output \"no\"."}},{"title":"Output","value":{"format":"MD","content":"For the i-th test case , first output Case #i: in a single line.\n\nThen output the answer of i-th test case."}},{"title":"Sample 1","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\u003e2\naba\n3\n1\n2\n3\naaa\n3\n1\n2\n3\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eCase #1:\nyes\nno\nyes\nCase #2:\nyes\nyes\nyes\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}