1 /**************************************************************
  2     Problem: 2245
  3     User: Tunix
  4     Language: C++
  5     Result: Accepted
  6     Time:1964 ms
  7     Memory:6216 kb
  8 ****************************************************************/
  9  
 10 //BZOJ 2245
 11 #include<vector>
 12 #include<cstdio>
 13 #include<cstring>
 14 #include<cstdlib>
 15 #include<iostream>
 16 #include<algorithm>
 17 #define rep(i,n) for(int i=0;i<n;++i)
 18 #define F(i,j,n) for(int i=j;i<=n;++i)
 19 #define D(i,j,n) for(int i=j;i>=n;--i)
 20 #define pb push_back
 21 using namespace std;
 22 inline int getint(){
 23     int v=0,sign=1; char ch=getchar();
 24     while(ch<‘0‘||ch>‘9‘){ if (ch==‘-‘) sign=-1; ch=getchar();}
 25     while(ch>=‘0‘&&ch<=‘9‘){ v=v*10+ch-‘0‘; ch=getchar();}
 26     return v*sign;
 27 }
 28 const int N=510,M=200000,INF=~0u>>2;
 29 typedef long long LL;
 30 /******************tamplate*********************/
 31 int n,m,c[N],a[251][251],s[6];
 32 LL ans;
 33 struct edge{int from,to,v,c;};
 34 struct Net{
 35     edge E[M];
 36     int head[N],next[M],cnt;
 37     void ins(int x,int y,int z,int c){
 38         E[++cnt]=(edge){x,y,z,c};
 39         next[cnt]=head[x]; head[x]=cnt;
 40     }
 41     void add(int x,int y,int z,int c){
 42         ins(x,y,z,c); ins(y,x,0,-c);
 43     }
 44     int from[N],Q[M],d[N],S,T,ed;
 45     bool inq[N],sign;
 46     bool spfa(){
 47         int l=0,r=-1;
 48         F(i,1,T) d[i]=INF;
 49         d[S]=0; Q[++r]=S; inq[S]=1;
 50         while(l<=r){
 51             int x=Q[l++];
 52             inq[x]=0;
 53             for(int i=head[x];i;i=next[i])
 54                 if(E[i].v>0 && d[x]+E[i].c<d[E[i].to]){
 55                     d[E[i].to]=d[x]+E[i].c;
 56                     from[E[i].to]=i;
 57                     if (!inq[E[i].to]){
 58                         Q[++r]=E[i].to;
 59                         inq[E[i].to]=1;
 60                     }
 61                 }
 62         }
 63         return d[T]!=INF;
 64     }
 65     void mcf(){
 66         int x=INF;
 67         for(int i=from[T];i;i=from[E[i].from])
 68             x=min(x,E[i].v);
 69         for(int i=from[T];i;i=from[E[i].from]){
 70             E[i].v-=x;
 71             E[i^1].v+=x;
 72         }
 73         ans+=(LL)x*d[T];
 74     }
 75     void init(){
 76         m=getint(); n=getint(); cnt=1;
 77         S=0; T=n+m+1;
 78         int x,y,z;
 79         F(i,1,n){
 80             x=getint();
 81             add(S,i,x,0);
 82         }
 83         F(j,1,m) F(i,1,n){
 84             x=getint();
 85             if(x) add(i,j+n,INF,0);
 86         }
 87         F(i,1,m){
 88             x=getint();
 89             if (x) F(j,1,x) s[j]=getint();
 90             s[0]=0; s[x+1]=INF;
 91             F(j,1,x+1){
 92                 y=getint();
 93                 add(i+n,T,s[j]-s[j-1],y);
 94             }
 95         }
 96         while(spfa()) mcf();
 97         printf("%lld\n",ans);
 98     }
 99 }G1;
100  
101 int main(){
102 #ifndef ONLINE_JUDGE
103     freopen("2245.in","r",stdin);
104     freopen("2245.out","w",stdout);
105 #endif
106     G1.init();
107     return 0;
108 }