const int maxn = 1000;

int n, s;

vector<int> G[maxn];
bool vis[maxn];
int match[maxn];
bool dfs(int u) 
{
    for (int i = 0; i < G[u].size(); i++)
    {
        int v = G[u][i];
        if (vis[v]) continue;
        vis[v] = true;
        if (match[v] == -1 || dfs(match[v])) 
        {
            match[v] = u;
            return true;
        }
    }
    return false;
}

int hungary(int n) //传入二分图一边的节点数
{
    int matches = 0;
    memset(match, -1, sizeof match);
    for(int i = 1; i <= n; ++i) 
    {
        memset(vis, 0, sizeof vis);
        matches += dfs(i);
    }
    return matches;
}

void init()
{
    for (int i = 1; i < maxn; i++) G[i].clear();
    scanf("%d%d", &n, &s);
}


void solve()
{
    if (s > 600 && n > 600) 
    {
        printf("No\n");
        return;
    }
    if (n <= 600) 
    {
        for (int i = 1; i <= n; i++)
        {
            for (int j = 1; j <= n; j++)
            {
                if ((s + i) % j == 0)
                {
                    G[i].push_back(j);
                }
            }
        }
        int m = hungary(n);
        if (m == n) printf("Yes\n");
        else printf("No\n");
        return;
    }
    for (int i = 1; i <= s; i++)
    {
        for (int j = 1; j <= s; j++)
        {
            if ((n + i) % j == 0)
            {
                G[i].push_back(j);
            }
        }
    }
    int m = hungary(s);
    if (m == s) printf("Yes\n");
    else printf("No\n");
}

int main()
{
    int T, kase = 0;
    scanf("%d", &T);
    while (T--)
    {
        printf("Case #%d: ", ++kase);
        init();
        solve();
    }
    return 0;
}