#include<bits/stdc++.h>
using namespace std;
#define ri int
typedef long long ll;
const int maxn=310;
template<class T>inline bool ckmin(T &x,const T &y){return x>y?x=y,1:0;}
template<class T>inline bool ckmax(T &x,const T &y){return x<y?x=y,1:0;}
template<class T>inline void clear(T *arr,int siz,int val=0){memset(arr,val,sizeof(T)*(siz+1));}
int a[maxn],ans[maxn][maxn],m,n;
int main(){
	scanf("%d%d",&n,&m);
	for(ri i=1;i<=m;++i)scanf("%d",a+i);
	if(n&1){
		if(*max_element(a+1,a+m+1)>(n+1>>1))return puts("No"),0;
		vector<int>pos;
		a[0]=a[m+1]=(n+1)>>1;
		for(ri i=0;i<=m+1;++i)
			if(a[i]==(n+1>>1)){
				if(i-1>0&&i<=m&&a[i-1]==(n+1>>1))return puts("No"),0;
				for(ri j=1;j<=n;j+=2)ans[j][i]=1;
				pos.push_back(i);
			}
		for(ri i=0;i+1<pos.size();++i){
			if((pos[i]&1)!=(pos[i+1]&1))
				for(ri j=pos[i]+1;j<pos[i+1];++j){
					for(ri k=n-(((j-pos[i])&1)^1);k>0&&a[j];k-=2){
						if(ans[k][j-1]||ans[k][j+1])break;
						ans[k][j]=1;
						--a[j];
					}
					for(ri k=((j-pos[i])&1)+1;a[j];k+=2){
						if(ans[k][j-1]||ans[k][j+1])return puts("No"),0;
						ans[k][j]=1;
						--a[j];
					}
				}
			else
				for(ri j=pos[i]+1;j<pos[i+1];++j)
					for(ri k=1;a[j];++k){
						if(k>n)return puts("No"),0;
						if(!ans[k][j-1]&&!ans[k-1][j]){
							ans[k][j]=1;
							--a[j];
						}
					}
		}
	}
	else{
		if(*max_element(a+1,a+m+1)>(n>>1))return puts("No"),0;
		for(ri i=1;i<=m;++i)
			for(ri j=1;a[i];++j)
				if(!ans[j][i-1]&&!ans[j-1][i]){
					ans[j][i]=1;
					--a[i];
				}
	}
	puts("Yes");
	for(ri i=1;i<=n;++i,printf("\n"))
		for(ri j=1;j<=m;++j)
			putchar(ans[i][j]|48);
	return 0;
}