{"trustable":true,"prependHtml":"\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 async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"panel_content\"\u003eLittle Ruins is a studious boy, but in rest time, he will play some little game.\u003cbr\u003e\u003cbr\u003eToday he found a game of eliminate: there is $N \\times M$ tiles which only contains \u003cb\u003e\u0027#\u0027\u003c/b\u003e and \u003cb\u003e\u0027*\u0027\u003c/b\u003e, you have two patterns to eliminate tiles:\u003cbr\u003e\u003cbr\u003e\u003cb\u003e:.\u003c/b\u003e\u003cbr\u003e\u003cbr\u003eand\u003cbr\u003e\u003cbr\u003e\u003cb\u003e.:\u003c/b\u003e\u003cbr\u003e\u003cbr\u003eEach step you can use a pattern and eliminate tiles \u003cb\u003eon the bottom two lines\u003c/b\u003e. After each step,the tiles above eliminated tiles will fall down.\u003cbr\u003e\u003cbr\u003eYour goal is to eliminate all \u003cb\u003e\u0027*\u0027\u003c/b\u003e tiles, please calculate the \u003cb\u003eminimum\u003c/b\u003e steps.\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"First line contains an integer $T$, which indicates the number of test cases.\u003cbr\u003e\u003cbr\u003eEvery test case begins with two integers $N$ and $M$, which indicates the size of tiles.\u003cbr\u003e\u003cbr\u003eIn the following N lines, every line contains $M$ characters means the type of tiles.\u003cbr\u003e\u003cbr\u003eLimits\u003cbr\u003e$1 \\leq T \\leq 50$.\u003cbr\u003e$1 \\leq N \\leq 2000$\u003cbr\u003e$2 \\leq M \\leq 2000$.\u003cbr\u003eFor 80% of the use cases, $1 \\leq N, M \\leq 100$ holds."}},{"title":"Output","value":{"format":"HTML","content":"For every test case, you should output \u003cb\u003e\u0027Case #x: y\u0027\u003c/b\u003e, where \u003cb\u003ex\u003c/b\u003e indicates the case number and counts from \u003cb\u003e1\u003c/b\u003e and \u003cb\u003ey\u003c/b\u003e is the result."}},{"title":"Sample","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\u003e1\r\n3 2\r\n#*\r\n*#\r\n##\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eCase #1: 2\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}