{"trustable":false,"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":"\u003cscript type\u003d\u0027text/x-mathjax-config\u0027\u003eMathJax.Hub.Config({tex2jax: { inlineMath: [[\u0027$\u0027,\u0027$\u0027]] } }); \u003c/script\u003e\n\u003cscript type\u003d\u0027text/javascript\u0027 src\u003d\u0027https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\u0027\u003e\u003c/script\u003e\n\u003cscript type\u003d\u0027text/javascript\u0027\u003esetTimeout(function(){MathJax.Hub.Queue([\u0027Typeset\u0027, MathJax.Hub, \u0027left_view\u0027]);}, 2000);\u003c/script\u003e\n\u003cdiv class\u003d\"panel_content\"\u003e\n As an old driver, you are suppossed to drive in an m*n ground(m rows,n columns).\n \u003cbr\u003eYou start from the point (x1,y1) and should go to the point (x2,y2).\n \u003cbr\u003eTo show your beautiful drift in the AE86, there have some obstacles on the ground. We use the char \u0027.\u0027 to show the vacant land and the char \u0027*\u0027 to show the obstacles.\n \u003cbr\u003eSo now you should set up a route driving horizontal or vertical only cross the vacant land. To make it easier you want to make as less drifts as possible. In other words, you want to turn left or right as less as possible. \n \u003cbr\u003eNotice that when you begin you can go to four direction and it won\u0027t count as a turn.\n \u003cbr\u003eSo please judge that can you finish your drive in k turns. Print \"yes\" or \"no\" as your answer.\n"}},{"title":"Input","value":{"format":"HTML","content":"In the first line there is an integer t (1 ≤ t ≤ 100), shows the amount of the test cases.\n\u003cbr\u003eFor each case, the first line is m and n(1 ≤ m,n ≤ 100), shows the rows and the columns of the ground .\n\u003cbr\u003eThen next m lines each has n chars of \u0027.\u0027 or \u0027*\u0027 shows the ground.\n\u003cbr\u003eAnd the last line are five integer k, x \n\u003csub\u003e1\u003c/sub\u003e, y \n\u003csub\u003e1\u003c/sub\u003e, x \n\u003csub\u003e2\u003c/sub\u003e, y \n\u003csub\u003e2\u003c/sub\u003e (1 ≤ k ≤ 10, 1 ≤ x \n\u003csub\u003e1\u003c/sub\u003e, x \n\u003csub\u003e2\u003c/sub\u003e ≤ n, 1 ≤ y \n\u003csub\u003e1\u003c/sub\u003e, y \n\u003csub\u003e2\u003c/sub\u003e ≤ m),k means the turns you can make,(x \n\u003csub\u003e1\u003c/sub\u003e, y \n\u003csub\u003e1\u003c/sub\u003e), (x \n\u003csub\u003e2\u003c/sub\u003e, y \n\u003csub\u003e2\u003c/sub\u003e)show the place you start and end.\n\u003cbr\u003e"}},{"title":"Output","value":{"format":"HTML","content":" Every test print one line, if you can finish your drive in k turns printf \"yes\", else you should print \"no\"."}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre\u003e2\n5 5\n...**\n*.**.\n.....\n.....\n*....\n1 1 1 1 3\n5 5\n...**\n*.**.\n.....\n.....\n*....\n2 1 1 1 3\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre\u003eno\nyes\u003c/pre\u003e"}},{"title":"Tips","value":{"format":"HTML","content":"This problem is in Chinese before but I turn it in to English.\n\u003cbr\u003eIt\u0027s obvious that I\u0027m not good at English so if you find some mistakes I made please don\u0027t tell me. If all of you can\u0027t know the meaning you can ask me in our QQ group. Of course I can\u0027t make sure I can answer your query 233..."}}]}