{"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\"\u003e Tom and Jerry are playing a game with tubes and pearls. The rule of the game is:\u003cbr\u003e\u003cbr\u003e 1) Tom and Jerry come up together with a number K. \u003cbr\u003e\u003cbr\u003e 2) Tom provides N tubes. Within each tube, there are several pearls. The number of pearls in each tube is at least 1 and at most N. \u003cbr\u003e\u003cbr\u003e 3) Jerry puts some more pearls into each tube. The number of pearls put into each tube has to be either 0 or a positive multiple of K. After that Jerry organizes these tubes in the order that the first tube has exact one pearl, the 2nd tube has exact 2 pearls, …, the Nth tube has exact N pearls.\u003cbr\u003e\u003cbr\u003e 4) If Jerry succeeds, he wins the game, otherwise Tom wins. \u003cbr\u003e\u003cbr\u003e Write a program to determine who wins the game according to a given N, K and initial number of pearls in each tube. If Tom wins the game, output “Tom”, otherwise, output “Jerry”. \u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":" The first line contains an integer M (M\u0026lt;\u003d500), then M games follow. For each game, the first line contains 2 integers, N and K (1 \u0026lt;\u003d N \u0026lt;\u003d 100, 1 \u0026lt;\u003d K \u0026lt;\u003d N), and the second line contains N integers presenting the number of pearls in each tube. "}},{"title":"Output","value":{"format":"HTML","content":" For each game, output a line containing either “Tom” or “Jerry”. "}},{"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\u003e2 \r\n5 1 \r\n1 2 3 4 5 \r\n6 2 \r\n1 2 3 4 5 5 \r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eJerry \r\nTom \r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}