{"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\n\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027$$$$$$\u0027, right: \u0027$$$$$$\u0027, display: true},\n {left: \u0027$$$\u0027, right: \u0027$$$\u0027, display: false},\n {left: \u0027$$\u0027, right: \u0027$$\u0027, display: true},\n {left: \u0027$\u0027, right: \u0027$\u0027, display: false}\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"Acmer同学家里最近开了个养鸡场,在场地设计上犯了难。r*c的地图上很多粒米(字母\"R\"),k只鸡,每个鸡都至少有一个粒米吃,每粒米最多1只鸡吃。每只鸡占领一块区域(区域包含至少一个R),并且每只鸡的区域不能重叠与交叉。请你帮Acmer同学规划一下养鸡场的场地,要求使得所有鸡的块中的R的个数,最大减最小的值最小。"}},{"title":"Input","value":{"format":"HTML","content":"输入包含T个样例(1≤T≤2⋅1e4)\n每个样例的第一行包含了三个正整数r,c和k代表了区域的长宽与米的数量\n接下来的r行每行c列 代表着地图"}},{"title":"Output","value":{"format":"HTML","content":"对于每个测试用例,打印r行,每行上有c个字符。每个字符应该是一个小写的英语字符,一个大写的英语字符,或者一个数字。当且仅当两个对应的单元格被分配给同一个鸡时,两个字符应该相等。大写字符和小写字符被认为是不同的,所以“A”和“A”属于两个不同的类型。\n如果有多个最佳答案,打印任何一个。"}},{"title":"Example","value":{"format":"HTML","content":"\u003cdiv class\u003d\"sample-test\"\u003e\n \u003cdiv class\u003d\"input\"\u003e\n \u003cdiv class\u003d\"title\"\u003e\n Input\n \u003c/div\u003e\n \u003cpre\u003e4\n3 5 3\n..R..\n...R.\n....R\n6 4 6\nR..R\nR..R\nRRRR\nRRRR\nR..R\nR..R\n5 5 4\nRRR..\nR.R..\nRRR..\nR..R.\nR...R\n2 31 62\nRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR\nRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR\n\u003c/pre\u003e\n \u003c/div\u003e\n \u003cdiv class\u003d\"output\"\u003e\n \u003cdiv class\u003d\"title\"\u003e\n Output\n \u003c/div\u003e\n \u003cpre\u003e11122\n22223\n33333\naacc\naBBc\naBBc\nCbbA\nCbbA\nCCAA\n11114\n22244\n32444\n33344\n33334\nabcdefghijklmnopqrstuvwxyzABCDE\nFGHIJKLMNOPQRSTUVWXYZ0123456789\u003c/pre\u003e\n \u003c/div\u003e\n\u003c/div\u003e"}},{"title":"Note","value":{"format":"HTML","content":"\u003cp\u003eThese pictures explain the sample output. Each color represents one chicken. Cells filled with patterns (not solid colors) contain rice.\u003c/p\u003e\n\u003cp\u003eIn the first test case, each chicken has one cell with rice. Hence, the difference between the maximum and the minimum number of cells with rice assigned to a chicken is 0.\u003c/p\u003e\n\u003cp\u003e\u003cimg class\u003d\"tex-graphics\" src\u003d\"CDN_BASE_URL/e90f86cd0d80a5b8a07cf6327c33022e?v\u003d1600288769\" style\u003d\"max-width: 100.0%;max-height: 100.0%;\"\u003e\u003c/p\u003e\n\u003cp\u003eIn the second test case, there are 4 chickens with 3 cells of rice, and 2 chickens with 2 cells of rice. Hence, the difference between the maximum and the minimum number of cells with rice assigned to a chicken is 3 - 2 \u003d 1.\u003c/p\u003e\n\u003cp\u003e\u003cimg class\u003d\"tex-graphics\" src\u003d\"CDN_BASE_URL/97518ba2d2e1b6da96e046c600058879?v\u003d1600288769\" style\u003d\"max-width: 100.0%;max-height: 100.0%;\"\u003e\u003c/p\u003e\n\u003cp\u003eIn the third test case, each chicken has 3 cells with rice. \u003cimg class\u003d\"tex-graphics\" src\u003d\"CDN_BASE_URL/a6dd7eedd6b7976cd9c6e2c86b018329?v\u003d1600288769\" style\u003d\"max-width: 100.0%;max-height: 100.0%;\"\u003e\u003c/p\u003e\n\u003cp\u003eIn the last test case, since there are 62 chicken with exactly 62 cells of rice, each chicken must be assigned to exactly one cell. The sample output is one of the possible way.\u003c/p\u003e"}}]}