Migrated from Lutece 1504 K

All parts of this problem, including description, images, samples, data and checker, might be broken. If you find bugs in this problem, please contact the admins.

Description

There is a kindom of obsession, so people in this kingdom do things very strictly.

They name themselves in integer, and there are $n$ people with their id continuous $(s+1,s+2,\ldots ,s+n)$ standing in a line in arbitrary order, be more obsessively, people with id $x$ wants to stand at $y$-th position which satisfy

Is there any way to satisfy everyone's requirement?

Input

First line contains an integer $T$ ($1\le T\le 100$), which indicates the number of test cases.

Every test case contains one line with two integers $n$, $s$ ($1\le n\le 10^9,0\le s\le 10^9$).

Output

For every test case, you should output Case #x: y, where x indicates the case number and counts from $1$ and y is the result string.

If there is any way to satisfy everyone's requirement, y equals Yes, otherwise y equals No.

Samples

2
5 14
4 11

Case #1: No
Case #2: Yes

Resources

第二届中国大学生程序设计竞赛 杭州站（CCPC 2016 Hangzhou Site）