#include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
//****************************************************
//最大流模板  SAP算法
//邻接表形式
//******************************************************
const int MAXN = 100000+110;//点数的最大值
const int MAXM = 4000110;//边数的最大值
const int INF = 0x3f3f3f3f;

struct Node
{
    int from,to,next;
    int cap;
}edge[MAXM];
int tol;
int head[MAXN];
int dep[MAXN];
int gap[MAXN];//gap[x]=y :说明残留网络中dep[i]==x的个数为y

int n;//n是总的点的个数，包括源点和汇点

void init()
{
    tol=0;
    memset(head,-1,sizeof(head));
}

void addedge(int u,int v,int w)
{
    edge[tol].from=u;
    edge[tol].to=v;
    edge[tol].cap=w;
    edge[tol].next=head[u];
    head[u]=tol++;
    edge[tol].from=v;
    edge[tol].to=u;
    edge[tol].cap=0;
    edge[tol].next=head[v];
    head[v]=tol++;
}
void BFS(int start,int end)
{
    memset(dep,-1,sizeof(dep));
    memset(gap,0,sizeof(gap));
    gap[0]=1;
    int que[MAXN];
    int front,rear;
    front=rear=0;
    dep[end]=0;
    que[rear++]=end;
    while(front!=rear)
    {
        int u=que[front++];
        if(front==MAXN)front=0;
        for(int i=head[u];i!=-1;i=edge[i].next)
        {
            int v=edge[i].to;
            if(dep[v]!=-1)continue;
            que[rear++]=v;
            if(rear==MAXN)rear=0;
            dep[v]=dep[u]+1;
            ++gap[dep[v]];
        }
    }
}
int SAP(int start,int end)
{
    int res=0;
    BFS(start,end);
    int cur[MAXN];
    int S[MAXN];
    int top=0;
    memcpy(cur,head,sizeof(head));
    int u=start;
    int i;
    while(dep[start]<n)
    {
        if(u==end)
        {
            int temp=INF;
            int inser;
            for(i=0;i<top;i++)
               if(temp>edge[S[i]].cap)
               {
                   temp=edge[S[i]].cap;
                   inser=i;
               }
            for(i=0;i<top;i++)
            {
                edge[S[i]].cap-=temp;
                edge[S[i]^1].cap+=temp;
            }
            res+=temp;
            top=inser;
            u=edge[S[top]].from;
        }
        if(u!=end&&gap[dep[u]-1]==0)//出现断层，无增广路
          break;
        for(i=cur[u];i!=-1;i=edge[i].next)
           if(edge[i].cap!=0&&dep[u]==dep[edge[i].to]+1)
             break;
        if(i!=-1)
        {
            cur[u]=i;
            S[top++]=i;
            u=edge[i].to;
        }
        else
        {
            int min=n;
            for(i=head[u];i!=-1;i=edge[i].next)
            {
                if(edge[i].cap==0)continue;
                if(min>dep[edge[i].to])
                {
                    min=dep[edge[i].to];
                    cur[u]=i;
                }
            }
            --gap[dep[u]];
            dep[u]=min+1;
            ++gap[dep[u]];
            if(u!=start)u=edge[S[--top]].from;
        }
    }
    return res;
}

int num[1025];
int bit[11];

int main()
{
    int N,M;
    int v;
    bit[0]=1;
    for(int i=1;i<=10;i++) bit[i]=bit[i-1]*2;
    while(scanf("%d%d",&N,&M)!=EOF){
        if(N==0||M==0) break;
        int st,ed;
        init();
        st=0,ed=N+M+1;
        n=N+M+2;
        memset(num,0,sizeof(num));
        for(int i=1;i<=N;i++){
            int tmp=0;
            for(int j=0;j<M;j++){  //状态压缩
                scanf("%d",&v);
                tmp+=v*bit[j];
            }
            num[tmp]++;
        }
        for(int i=0;i<1024;i++){
            if(num[i]==0) continue;
            addedge(i+1+M,ed,num[i]);
            for(int j=0;j<10;j++)
                if(i&bit[j])
                   addedge(j+1,i+1+M,INF);
        }
        for(int i=1;i<=M;i++){
            scanf("%d",&v);
            addedge(st,i,v);
        }
        int ans=SAP(st,ed);
        if(ans==N) printf("YES\n");
        else printf("NO\n");
    }
    return 0;
}