#include<iostream>
#include<cstdio>
#include<queue>
#include<cstring>
using namespace std;
const long long N=505,P=100005,inf=1e18;
long long m,n,c[N],a[N][N],s[N],t[N][10],w[N][10],S,T=1005,ans,fr[P],dis[P],h[P],cnt=1;
bool vis[P];
struct qwe
{long long ne,no,to,va,c;
}e[P<<1];
long long read()
{long long r=0,f=1;char p=getchar();while(p>'9'||p<'0'){if(p=='-')f=-1;p=getchar();}while(p>='0'&&p<='9'){r=r*10+p-48;p=getchar();}return r*f;
}
void add(long long u,long long v,long long w,long long c)
{cnt++;e[cnt].ne=h[u];e[cnt].no=u;e[cnt].to=v;e[cnt].va=w;e[cnt].c=c;h[u]=cnt;
}
void ins(long long u,long long v,long long w,long long c)
{add(u,v,w,c);add(v,u,0,-c);
}
bool spfa()
{queue<long long>q;for(int i=S;i<=T;i++)dis[i]=inf;vis[S]=1;dis[S]=0;q.push(S);while(!q.empty()){long long u=q.front();q.pop();vis[u]=0;for(int i=h[u];i;i=e[i].ne)if(e[i].va>0&&dis[e[i].to]>dis[u]+e[i].c){fr[e[i].to]=i;dis[e[i].to]=dis[u]+e[i].c;if(!vis[e[i].to]){vis[e[i].to]=1;q.push(e[i].to);}}}return dis[T]!=inf;
}
void mcf()
{long long x=inf;for(int i=fr[T];i;i=fr[e[i].no])x=min(x,e[i].va);for(int i=fr[T];i;i=fr[e[i].no]){ans+=x*e[i].c;e[i].va-=x;e[i^1].va+=x;}
}
int main()
{m=read(),n=read();for(int i=1;i<=n;i++){c[i]=read();ins(S,i,c[i],0);}for(int i=1;i<=m;i++)for(int j=1;j<=n;j++){a[i][j]=read();if(a[i][j])ins(j,i+n,inf,0);}for(int i=1;i<=m;i++){s[i]=read();for(int j=1;j<=s[i];j++)t[i][j]=read();t[i][s[i]+1]=inf;for(int j=1;j<=s[i]+1;j++){w[i][j]=read();ins(i+n,T,t[i][j]-t[i][j-1],w[i][j]);}}while(spfa())mcf();printf("%lld",ans);return 0;
}
/*
2 3
2 2 2
1 1 0
0 0 1
1
2
1 10
1
2
1 6
*/
