#pragma GCC optimize(2)

 #include <cmath>

 #include <cstdio>

 #include <cstring>

 #define REP(i,low,high) for(register int i=(low);i<=(high);i++)

 #define INF 1e10

 #define eps 1e-7

 using namespace std;

 inline bool getmin(double &tar,const double &pat) {return pat+eps<tar?tar=pat,:;}

 double a[][]; int m,n;

 inline int check() {REP(i,,m) if(a[i][]>eps) return i; return ;}

 inline double Simplex()

 {

     while(int x=check())

     {

         int y=; double lim=INF; REP(i,,n) if(a[x][i]>eps&&getmin(lim,a[][i]/a[x][i])) y=i;

         if(!y) return a[][]=INF; double p=1.0/a[x][y]; a[x][y]=1.0; REP(i,,m) a[i][y]*=p;

         REP(i,,n) if(i!=y)

         {

             double now=a[x][i];

             if(fabs(now)>eps) {a[][i]-=now*a[][y]; REP(j,,m) a[j][i]-=now*a[j][y]; a[x][i]=-now*p;}

         }

         double now=a[x][]; a[][]+=now*a[][y]; REP(i,,m) a[i][]-=now*a[i][y]; a[x][]=-now*p;

     }

     return a[][];

 }

 int main()

 {

     scanf("%d%d",&m,&n); REP(i,,m) scanf("%lf",&a[i][]);

     REP(i,,n) {int S,T; scanf("%d%d",&S,&T); REP(j,S,T) a[j][i]=1.0; scanf("%lf",&a[][i]);}

     return printf("%.0lf\n",Simplex()+eps),;

 }