{"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\"\u003eAgrael likes play a simple game with his friend Animal during the classes. In this Game there are n piles of stones numbered from 1 to n, the 1st pile has M\u003csub\u003e1\u003c/sub\u003e stones, the 2nd pile has M\u003csub\u003e2\u003c/sub\u003e stones, ... and the n-th pile contain M\u003csub\u003en\u003c/sub\u003e stones. Agrael and Animal take turns to move and in each move each of the players can take at most L\u003csub\u003e1\u003c/sub\u003e stones from the 1st pile or take at most L\u003csub\u003e2\u003c/sub\u003e stones from the 2nd pile or ... or take L\u003csub\u003en\u003c/sub\u003e stones from the n-th pile. The player who takes the last stone wins.\u003cbr\u003e\u003cbr\u003eAfter Agrael and Animal have played the game for months, the teacher finally got angry and decided to punish them. But when he knows the rule of the game, he is so interested in this game that he asks Agrael to play the game with him and if Agrael wins, he won\u0027t be punished, can Agrael win the game if the teacher and Agrael both take the best move in their turn?\u003cbr\u003e\u003cbr\u003eThe teacher always moves first(-_-), and in each turn a player must takes at least 1 stones and they can\u0027t take stones from more than one piles.\u003cbr\u003e\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"The first line contains the number of test cases. Each test cases begin with the number n (n ≤ 10), represent there are n piles. Then there are n lines follows, the i-th line contains two numbers M\u003csub\u003ei\u003c/sub\u003e and L\u003csub\u003ei\u003c/sub\u003e (20 ≥ M\u003csub\u003ei\u003c/sub\u003e \u0026gt; 0, 20 ≥ L\u003csub\u003ei\u003c/sub\u003e \u0026gt; 0). \u003cbr\u003e"}},{"title":"Output","value":{"format":"HTML","content":"Your program output one line per case, if Agrael can win the game print \"Yes\", else print \"No\". \u003cbr\u003e"}},{"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\n1\r\n5 4\r\n2\r\n1 1\r\n2 2\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eYes\r\nNo\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}