uva1099

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
const int maxn = 107, maxm = 16;
int n, x, y, input[maxm], sum[1 << maxm], f[1 << maxm][maxn],vis[1 << maxm][maxn];

int bitcount(int x) { return x == 0 ? 0 : bitcount(x >> 1) + (x & 1); }

int dp(int r, int s) {
	if (vis[s][r]) return f[s][r];
	vis[s][r] = 1;

	int &ans = f[s][r];
	if (bitcount(s) == 1) return ans = 1;
	ans = 0;
	int c = sum[s] / r;

	for (int s0 = (s - 1) & s; s0; s0 = (s0 - 1) & s) {
		int s1 = s - s0;
		if (sum[s0] % r == 0 && dp(min(r, sum[s0] / r), s0) && dp(min(r, sum[s1] / r), s1)) return ans = 1;

		if (sum[s0] % c == 0 && dp(min(c, sum[s0] / c), s0) && dp(min(c, sum[s1] / c), s1)) return ans = 1;
	}
	return ans;
}

int main()
{
	int kCase = 1;
	while (cin >> n && n) {
		cin >> x >> y;
		for (int i = 0; i < n; i++) cin >> input[i];
		memset(sum, 0, sizeof(sum));
		for (int i = 0; i < 1 << n; i++) {
			for (int j = 0; j < n; j++) {
				if ((1 << j) & i) {
					sum[i] += input[j];
				}
			}
		}
		memset(vis, 0, sizeof(vis));
		int all = (1 << n) - 1,ans = 0;
		if (sum[all] != x * y || sum[all] % x != 0) ans = 0;
		else ans = dp(min(x,y),all);

		cout << "Case " << kCase++ << ": " << (ans ? "Yes" : "No") << endl;
	}
	return 0;
}