Problem: Recently Petya walked in the forest and found a magic stick.

Since Petya really likes numbers, the first thing he learned was spells for changing numbers. So far, he knows only two spells that can be applied to a positive integer: 

  1. If the chosen number a is even, then the spell will turn it into 3a/2; 
  2. If the chosen number a is greater than one, then the spell will turn it into a-1. 



Note that if the number is even and greater than one, then Petya can choose which spell to apply.

Petya now has only one number x. He wants to know if his favorite number y can be obtained from x using the spells he knows. The spells can be used any number of times in any order. It is not required to use spells, Petya can leave x as it is.

Input

The first line contains single integer T (1 ≤ T ≤ 10^4) — the number of test cases. Each test case consists of two lines.

The first line of each test case contains two integers x and y (1 ≤ x, y ≤ 10^9) — the current number and the number that Petya wants to get.

Output

For the i-th test case print the answer on it — YES if Petya can get the number y from the number x using known spells, and NO otherwise.

You may print every letter in any case you want (so, for example, the strings yEs, yes, Yes and YES will all be recognized as positive answer).

Example

Input


7
2 3
1 1
3 6
6 8
1 2
4 1
31235 6578234


Output


YES
YES
NO
YES
NO
YES
YES

Solution (in JAVA):

Solution:
import java.util.*;

public class KosyaReshaetZadachi {

    public static void main (String[] args) {
        Scanner scan = new Scanner(System.in);

        long t = scan.nextLong();

        for(int q = 0; q < t; q++) {

            int x = scan.nextInt();
            int y = scan.nextInt();

            if( x >= y || x >= 4) {
                System.out.println("YES");
                continue;
            }

            if( x == 2 && y == 3 ) {
                System.out.println("YES");
            } else {
                System.out.println("NO");
            }

        }
    }

//    static long gcd(long a, long b)
//    {
//        if (a == 0)
//            return b;
//        return gcd(b % a, a);
//    }
//
//    static long findGCD(ArrayList<Long> arr, long n)
//    {
//        long result = arr.get(0);
//
//        for (int i = 1; i < n; i++) {
//            result = gcd(arr.get(i), result);
//
//            if(result == 1){
//                break;
//            }
//        }
//
//        return result;
//    }

}