

Kingdom of ObsessionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4861 Accepted Submission(s): 1421 Problem 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, \cdots, 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 $$x \mod y = 0$$ Is there any way to satisfy everyone's requirement? Input First line contains an integer $T$, which indicates the number of test cases. Every test case contains one line with two integers $n$, $s$. Limits $1 \leq T \leq 100$. $1 \leq n \leq 10^9$. $0 \leq s \leq 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'. Sample Input
Sample Output
Source  
