#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<queue>
#include<bitset>
#include<math.h>
#include<vector>
#include<string>
#include<stdio.h>
#include<cstring>
#include<iostream>
#include<algorithm>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
typedef double db;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
const db eps=1e-5;
const int N=2e3+10;
const int M=4e6+10;
const ll MOD=1000000007;
const int mod=1000000007;
const int MAX=1000000010;
const double pi=acos(-1.0);
int n,s;
int tot,u[N],v[M],cap[M],flow[M],pre[M];
void add(int a,int b,int c,int f) {
v[tot]=b;flow[tot]=f;cap[tot]=c;pre[tot]=u[a];u[a]=tot++;
}
bool q[N];
int d[N],dis[N],head[N];
bool bfs(int a,int b) {
int i,l=1,r=1;
memset(q,0,sizeof(q));
d[1]=a;q[a]=1;dis[a]=0;
for (;l<=r;l++)
for (i=u[d[l]];~i;i=pre[i])
if (!q[v[i]]&&cap[i]-flow[i]) d[++r]=v[i],q[v[i]]=1,dis[v[i]]=dis[d[l]]+1;
return q[b];
}
int dfs(int a,int b,int en) {
if (a==en||b==0) return b;
int ret=0,f;
for (int &i=u[a];~i;i=pre[i])
if (dis[v[i]]==dis[a]+1&&(f=dfs(v[i],min(b,cap[i]-flow[i]),en))>0) {
flow[i]+=f;flow[i^1]-=f;
ret+=f;b-=f;
if (b==0) break ;
}
return ret;
}
int pd() {
int i,j,S=0,T=2*n+1,ret=0;
tot=0;memset(u,-1,sizeof(u));
for (i=1;i<=n;i++) add(S,i,1,0),add(i,S,0,0);
for (i=1;i<=n;i++) add(i+n,T,1,0),add(T,i+n,0,0);
for (i=1;i<=n;i++)
for (j=s+1+(i-(s+1)%i)%i;j<=s+n;j+=i) add(i,j-s+n,1,0),add(j-s+n,i,0,0);
for (i=S;i<=T;i++) head[i]=u[i];
while (bfs(S,T)) {
ret+=dfs(S,MAX,T);
for (i=S;i<=T;i++) u[i]=head[i];
}
return ret==n;
}
int main()
{
int ca,T;
scanf("%d", &T);
for (ca=1;ca<=T;ca++) {
scanf("%d%d", &n, &s);
if (n>s) swap(n,s);
if (n>1000||!pd()) printf("Case #%d: No\n", ca);
else printf("Case #%d: Yes\n", ca);
}
return 0;
}