#include<stdio.h>
#include<stdlib.h>
#define maxn 10005
int m = 0, k = 0;
int dp[maxn];
int f(int i)
{
	if (i > m)
	{
		for (int j = 1; j <= m; j++)
		{
			int flag = 1;
			for (int l = k; l >= 1; l--)
				if (i - j - l < 0 || dp[i - j - l] == 0)
				{
					flag = 0;
					break;
				}
			if (flag)
				return 1;
		}
		return 0;
	}
	else
		return 1;
}

int main()
{
	int n;
	int ai[maxn];
	scanf("%d%d%d", &n, &m, &k);
	for (int i = 0; i < n; i++)
		scanf("%d", &ai[i]);
	int max = ai[0];
	for (int i = 1; i < n; i++)
		if (ai[i] > max) max = ai[i];
	dp[0] = 0;
	for (int i = 1; i <= max; i++)
	{
		dp[i] = f(i);
		printf(" %d", dp[i]);
	}
	int flag = 1;
	for (int i = 0; i < n; i++)
		if (dp[ai[i]] == 0)
		{
			flag = 0; 
			break;
		}
	if (flag)
		printf("Yes");
	else
		printf("No");

	return 0;
}