#include<bits/stdc++.h>

 using namespace std;

 #define cls(x, val) memset(x,val,sizeof(x))

 #define RI register int

 #define eps 1e-6

 typedef long long ll;

 typedef unsigned long long ull;

 const int INF=0x3f3f3f3f;

 inline int read()

 {

     int x=,f=;char ch=getchar();

     while(ch<''||ch>'') {if(ch=='-') f=-;ch=getchar();}

     while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}

     return x*f;

 }

 const int N=;

 const int M=;

 int n,m;

 double a[M][N],b[M],c[M],v;

 inline void pivot(int l,int e)//矩阵的转秩

 {

     b[l]/=a[l][e];

     for(int j=;j<=n;++j)

     {

         if(j!=e) a[l][j]/=a[l][e];

     }

     a[l][e]=/a[l][e];

     for(int i=;i<=m;++i)

     {

         if(i!=l&&fabs(a[i][e])>)

         {

             b[i]-=a[i][e]*b[l];

             for(int j=;j<=n;++j)

             {

                 if(j!=e) a[i][j]-=a[i][e]*a[l][j];

             }

             a[i][e]=-a[i][e]*a[l][e];

         }

     }

     v+=c[e]*b[l];

     for(int j=;j<=n;++j)

     {

         if(j!=e) c[j]-=c[e]*a[l][j];

     }

     c[e]=-c[e]*a[l][e];

 }

 inline double simplex()

 {

     while()

     {

         int e=,l=;

         for(e=;e<=n;++e)

         {

             if(c[e]>eps) break;

         }

         if(e==n+) return v;

         double mn=INF;

         for(int i=;i<=m;++i)

         {

             if(a[i][e]>eps&&mn>b[i]/a[i][e]) mn=b[i]/a[i][e],l=i;

         }

         if(mn==INF) return INF;

         pivot(l,e);

     }

 }

 int main()

 {

     n=read(),m=read();

     for(RI i=;i<=n;++i) c[i]=read();

     for(RI i=;i<=m;++i)

     {

         RI k=read();

         while(k--)

         {

             int s,t;

             s=read(),t=read();

             for(RI j=s;j<=t;++j) a[i][j]=1.0;

         }

         b[i]=read();

     }

     printf("%d\n",(int)(simplex()+0.5));

     return ;

 }