unittest
{
	assert( [ "6 3 4", "3", "1", "3", "2" ].parse.expand.solve == "No\nNo\nYes\nNo\nNo\nNo" );
	assert( [ "6 5 4", "3", "1", "3", "2" ].parse.expand.solve == "Yes\nYes\nYes\nYes\nYes\nYes" );
	assert( [ "10 13 15", "3", "1", "4", "1", "5", "9", "2", "6", "5", "3", "5", "8", "9", "7", "9" ].parse.expand.solve == "No\nNo\nNo\nNo\nYes\nNo\nNo\nNo\nYes\nNo" );
}



import std.conv;
import std.range;
import std.stdio;
import std.typecons;

void main()
{
	stdin.byLineCopy.parse.expand.solve.writeln;
}

auto parse( Range )( Range input )
if( isInputRange!Range && is( ElementType!Range == string ) )
{
	auto nkq = input.front.split.to!( long[] );
	auto as = new long[ nkq[ 2 ] ];
	foreach( ref a; as )
	{
		input.popFront;
		a = input.front.to!( long );
	}
	as[] -= 1;
	return tuple( nkq[ 0 ], nkq[ 1 ], as );
}

auto solve( long n, long k, long[] as )
{
	auto ps = new long[ n ];
	foreach( a; as )
	{
		ps[ a ]++;
	}
	
	auto anss = new string[ n ];
	foreach( ref ans, p; lockstep( anss, ps ) )
	{
		ans = ( 0 < k + p - as.length.signed ) ? "Yes" : "No";
	}
	return anss.join( "\n" );
}
