Vasja and Pete play the following game. Vasja draws on the plane of \textbf{N} points and says the number of \textbf{M}. Peter has to answer whether you can combine these \textbf{N} points with \textbf{M} lines, so that: \begin{enumerate} \item Each line connects exactly two points. \item No line is not connecting the dots with itself. \item For any pair of points there is no more than one connecting their lines. \item There exist two points \textbf{A} and \textbf{B}, that can not get from \textbf{A} along the drawn lines to \textbf{B} (for each line can go in any direction). \end{enumerate} When Peter answers correctly, he wins, otherwise Vasja wins. Your task - to write a program that helps Pete always win. \InputFile The first line of the input file is written the number of \textbf{K} - number of tests in the input file (\textbf{1} ≤ \textbf{K} ≤ \textbf{1000}). The following \textbf{K} lines contain the number \textbf{N} (\textbf{1} ≤ \textbf{N} ≤ \textbf{10^9}) and \textbf{M} (\textbf{0} ≤ \textbf{M} ≤ \textbf{10^9}). \OutputFile For each of the \textbf{K} tests on a separate line write down the correct answer to the question Vasja, a string "\textbf{Yes}" (if yes) or "\textbf{No}" (if the answer is no.)