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.

**Input:**

First line of input contains the number of test cases.

Each line of test case contains 2 integers n and m.

**Output:**

Print "Yes" if its possible to represent the number else "No" without quotes.

**Constraints:**

1<=T<=100

1<= n<= 10^9

1<=m<=32

**Example:**

**Sample Input:**

2

8 2

8 3

**Sample Output:**

Yes

No

Ibrahim Nash | 119 |

Ryan Yang | 87 |

Robin Kendrick | 83 |

aristotle | 79 |

bz24244 | 79 |

Lam Ngoc Pham | 476 |

All Is Well | 399 |

Prateek Gole | 385 |

Divvya Sinha | 374 |

Ibrahim Nash | 359 |

akhayrutdinov | 3873 |

sanjay05 | 3366 |

Michael Riegger | 2035 |

Jasleen Kaur 2 | 2012 |

Quandray | 1982 |