Given a number (n) and no. of digits (m) to represent the number, find if given number can be represented in given no. of digits in any base from 2 to 32.
First line of input contains the number of test cases.
Each line of test case contains 2 integers n and m.
Print "Yes" if its possible to represent the number else "No" without quotes.
1<= n<= 10^9