Company: iRageCapital_30july
Difficulty: medium
Game of Coordinates Problem Description You are given the coordinates (x, y). Initially, you are at (1, 1) and are required to go to (x, y) using the following rules: If the current position is (a, b), then in the next move, you can only move to (a+b, b) or (a, a+b). Write a program to check if you can reach (x, y) using only the described moves. Input Format The first line contains an integer T that represents the number of test cases. Each of the next T lines contains two space-separated integers representing (x, y). Output Format For each test case, print "Yes" if it is possible for you to reach (x, y) else print "No" (without quotes) in a separate line. Constraints T 1 Examples Example 1: Input: 3 1 2 3 2 4 6 Output: Yes Yes No Explanation: For test case 1: (1,1) -> (1,1+1)=(1,2). For test case 2: (1,1) -> (1,2) -> (2,2) -> (2,3). There is no way of reaching (4,6).