{"raw_statement":[{"iden":"statement","content":"De Prezer loves TROYs. A TROY is a 1018 × 1018 square and there is either  + 1 or  - 1 in each cell of this square (actually it's a grid).\n\nThere are two types of operation : \n\n1. Multiply all numbers in a row by  - 1 .\n\n2. Multyply all numbers in a column by  - 1 .\n\nDe Prezer has found two TROYs, the number in the j - th column of the i - th row of the first TROY is ai, j and in the second TROY is bi, j .\n\nDe Prezer also loves query, so he gives you some queries. \n\nFirst of all, you don't have any information about numbers in these two TROYs. Each query, gives the values x ,y, ax, y, bx, y (that you didn't get before), and you should tell him if it is can be possible to transform the first TROY to the second one (the values in the cells that we don't know, could be the way that we can transform the first TROY to the second one) using the operations above, with the information you got so far.\n\nThe first line of input contains integer n, the number of queries.\n\nEach of the next n lines, contain 4 integers x ,y, ax, y, bx, y .\n\n1 ≤ n ≤ 105\n\n1 ≤ x, y ≤ 1018 and \n\nFor each query, print a single string in a line, \"Yes\" or \"No\" (Without quotes).\n\n"},{"iden":"input","content":"The first line of input contains integer n, the number of queries.Each of the next n lines, contain 4 integers x ,y, ax, y, bx, y .1 ≤ n ≤ 1051 ≤ x, y ≤ 1018 and "},{"iden":"output","content":"For each query, print a single string in a line, \"Yes\" or \"No\" (Without quotes)."},{"iden":"examples","content":"Input3829054240386762533 576622723736087196 +1 -1659693256240999920 576622723736087196 +1 +1395697514003384346 576622723736087196 +1 +1OutputYesYesYesInput41 1 +1 -11 2 +1 -12 1 +1 -12 2 +1 +1OutputYesYesYesNo"}],"translated_statement":null,"sample_group":[],"show_order":[],"formal_statement":"Let $ n, m \\in \\mathbb{Z} $ with $ 1 \\leq n, m \\leq 10^{100} $.  \nThe maximum number of happy customers is $ \\left\\lfloor \\frac{n}{m} \\right\\rfloor $.","simple_statement":"Given n candles and m candles needed per customer, find the maximum number of happy customers, which is n divided by m.","has_page_source":false}