#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<vector>
#include<queue>
#include<algorithm>
#include<string>
#include<sstream>
#include<cctype>
#include<cmath>
#include<iomanip>
#include<map>
#include<stack>
#include<set>
#include<functional>
#define in(x) x=read()
#define qr read()
#define int ll
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
namespace fastIO
{
    #define BUF_SIZE 100000
    bool IOerror=0;
    inline char nc()
	{
        static char buf[BUF_SIZE],*p1=buf+BUF_SIZE,*pend=buf+BUF_SIZE;
        if (p1==pend){
            p1=buf; pend=buf+fread(buf,1,BUF_SIZE,stdin);
            if (pend==p1){IOerror=1;return -1;}
        }
        return *p1++;
    }
    inline bool blank(char ch){return ch==' '||ch=='\n'||ch=='\r'||ch=='\t';}
    inline ll read()
	{
        bool sign=0; char ch=nc();ll x=0;
        for (;blank(ch);ch=nc());
        if (IOerror)return 0;
        if (ch=='-')sign=1,ch=nc();
        for (;ch>='0'&&ch<='9';ch=nc())x=x*10+ch-'0';
        if (sign)x=-x;
        return x;
    }
    #undef BUF_SIZE
};
using namespace fastIO;
int a[1000010],c[1010][1010],n,m;
vector<int>v;
bool doit(int l,int r)
{
	if(l>r)return 0;
	if((r-l+1)&1)
	{
		int f=0;
		for(int i=l;i<=r;i++)
		{
			f^=1;
			for(int p=f+1,j=1;j<=a[i];p+=2,j++)
			{
				c[p][i]=1;
			}
		}
		return 1;
	}
	else
	{
		int f=1;
		int pos=f-1;
		for(int p=f+1,j=1;j<=a[l];p+=2,j++)
		{
			c[p][l]=1;
			pos=p;
		}
		f^=1;
		for(int i=l+1;i<=r;i++)
		{
			f^=1;
			int num=1;
			for(int p=n-f;num<=a[i];num++,p-=2)
			{
				// cout<<p<<":"<<c[p][i-1]<<'\n';
				if(c[p][i-1])break;
				else c[p][i]=1;
			}
			// cout<<i<<":"<<num<<'\n';
			if(num>a[i])continue;
			else if(i==r)return 0;
			else
			{
				f^=1;
				for(int p=f+1;num<=a[i];num++,p+=2)c[p][i]=1;//cout<<p<<' ';cout<<'\n';
				f^=1;
			}
			/*
			if(!g&&a[i]+a[i-1]<=n/2+((i-1-l)&1))
			{
				for(int p=pos+2,j=1;j<=a[i];p+=2,j++)
				{
					c[p][i]=1;
				}
				g=1;
				continue;
			}
			f^=1;
			pos=f-1;
			for(int p=f+1,j=1;j<=a[i];p+=2,j++)
			{
				c[p][i]=1;
				pos=p;
			}
			*/
		}
		return 1;
	}
}
signed main()
{
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	n=qr,m=qr;
	for(int i=1;i<=m;i++)in(a[i]);
	if(n%2==0)
	{
		int f=0;
		for(int i=1;i<=m;i++)
		{
			if(a[i]>n/2)
			{
				f=1;
				break;
			}
			for(int p=(i&1)+1,j=1;j<=a[i];p+=2,j++)
			{
				c[p][i]=1;
			}
		}
		if(f)puts("No");
		else
		{
			puts("Yes");
			for(int i=1;i<=n;i++)
			{
				for(int j=1;j<=m;j++)cout<<c[i][j];
				cout<<'\n';
			}
		}
		return 0;
	}
	else
	{
		int f=0;
		for(int i=1;i<=m;i++)
		{
			if(a[i]>n/2+1)f=1;
			if(a[i]==n/2+1)
			{
				for(int j=1;j<=n;j+=2)c[j][i]=1;
				// cout<<i<<'\n';			
				v.push_back(i);
			}
		}
		if(f)return puts("No"),0;
		if(!v.size())
		{
			for(int i=1;i<=m;i++)
			{
				for(int p=(i&1)+1,j=1;j<=a[i];p+=2,j++)
				{
					c[p][i]=1;
				}
			}
		}
		else
		{
			int f=0;
			for(int i=v[0]-1;i>=1;i--)
			{
				f^=1;
				for(int p=f+1,j=1;j<=a[i];p+=2,j++)
				{
					c[p][i]=1;
				}
			}
			f=0;
			// cout<<v.back()<<endl;
			for(int i=v.back()+1;i<=m;i++)
			{
				// cout<<i<<endl;
				f^=1;
				for(int p=f+1,j=1;j<=a[i];p+=2,j++)
				{
					c[p][i]=1;
				}
			}
			// cout<<v.size()<<'\n';
			for(int i=0;i<v.size()-1;i++)
			{
				if(!doit(v[i]+1,v[i+1]-1))return puts("No"),0;
			}
		}
		puts("Yes");
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=m;j++)cout<<c[i][j];
			cout<<'\n';
		}
	}
	return 0;
}