{"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\u003eJeel and Ashish play a game on an $$$n \\times m$$$ matrix. The rows are numbered $$$1$$$ to $$$n$$$ from top to bottom and the columns are numbered $$$1$$$ to $$$m$$$ from left to right. They play turn by turn. Ashish goes \u003cspan class\u003d\"tex-font-style-bf\"\u003efirst\u003c/span\u003e.\u003c/p\u003e\u003cp\u003eInitially, each cell of the matrix contains a non-negative integer. Each turn, a player must perform \u003cspan class\u003d\"tex-font-style-bf\"\u003eall\u003c/span\u003e of the following actions in order. \u003c/p\u003e\u003cul\u003e \u003cli\u003e Choose a starting cell $$$(r_1, c_1)$$$ with \u003cspan class\u003d\"tex-font-style-bf\"\u003enon-zero\u003c/span\u003e value. \u003c/li\u003e\u003cli\u003e Choose a finishing cell $$$(r_2, c_2)$$$ such that $$$r_1 \\leq r_2$$$ and $$$c_1 \\leq c_2$$$. \u003c/li\u003e\u003cli\u003e Decrease the value of the starting cell by some positive non-zero integer. \u003c/li\u003e\u003cli\u003e Pick any of the shortest paths between the two cells and either increase, decrease or leave the values of cells on this path unchanged. Note that: \u003cul\u003e \u003cli\u003e a shortest path is one that passes through the least number of cells; \u003c/li\u003e\u003cli\u003e all cells on this path \u003cspan class\u003d\"tex-font-style-bf\"\u003eexcluding\u003c/span\u003e the starting cell, but the finishing cell may be modified; \u003c/li\u003e\u003cli\u003e the resulting value of each cell must be a non-negative integer; \u003c/li\u003e\u003cli\u003e the cells are modified independently and not necessarily by the same value. \u003c/li\u003e\u003c/ul\u003e \u003c/li\u003e\u003c/ul\u003e\u003cp\u003eIf the starting and ending cells are the same, then as per the rules, the value of the cell is decreased. No other operations are performed.\u003c/p\u003e\u003cp\u003eThe game ends when all the values become zero. The player who is unable to make a move loses. It can be shown that the game will end in a finite number of moves if both players play optimally.\u003c/p\u003e\u003cp\u003eGiven the initial matrix, if both players play optimally, can you predict who will win?\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eThe first line contains a single integer $$$t$$$ ($$$1 \\leq t \\leq 10$$$)\u0026nbsp;— the number of test cases. The description of each test case is as follows.\u003c/p\u003e\u003cp\u003eThe first line of each test case contains two integers $$$n$$$ and $$$m$$$ ($$$1 \\leq n, m \\leq 100$$$)\u0026nbsp;— the dimensions of the matrix.\u003c/p\u003e\u003cp\u003eThe next $$$n$$$ lines contain $$$m$$$ space separated integers $$$a_{i,j}$$$ ($$$0 \\leq a_{i,j} \\leq 10^6$$$)\u0026nbsp;— the values of each cell of the matrix.\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003eFor each test case, if Ashish wins the game, print \"\u003cspan class\u003d\"tex-font-style-tt\"\u003eAshish\u003c/span\u003e\", otherwise print \"\u003cspan class\u003d\"tex-font-style-tt\"\u003eJeel\u003c/span\u003e\" (without the quotes).\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\u003e4\n1 1\n0\n1 3\n0 0 5\n2 2\n0 1\n1 0\n3 3\n1 2 3\n4 5 6\n7 8 9\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eJeel\nAshish\nJeel\nAshish\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\u003eIn the first test case, the only cell of the matrix is 0. There are no moves Ashish can make. Jeel is the winner.\u003c/p\u003e\u003cp\u003eIn the second test case, Ashish can choose $$$(r_1, c_1) \u003d (r_2, c_2) \u003d (1,3)$$$ and reduce the cell to $$$0$$$, leaving $$$[0, 0, 0]$$$. Jeel cannot perform any moves. Ashish wins.\u003c/p\u003e"}}]}