graph g;
int@n,@m,@a[n],@(u,v)--[m];
g.setEdge(n,m,u,v);
rep(b,1<<n){
	rep(i,n){
		int c=0;
		rep[g.edge[i]](j,g.es[i]){
			c+=b>>j&1;
		}
		if(c!=a[i]){
			break_continue;
		}
	}
	wt("Yes");
	wtSp(b>>(0..n-1)&1);
	exit(0);
}
wt("No");