#include<bits/stdc++.h>

using namespace std;

const int N = ;

const double eps = 1e-;

int n, m, l, e;

int p[N * ];

double a[N][N * ], b[N * ][N];

void pivot(int l, int e)

{

    double r = a[l][e]; a[l][e] = 1.0;

    for(int i = ; i <= n; ++i) a[l][i] /= r;

    p[] = ;

    for(int i = ; i <= n; ++i) p[++p[]] = i;

    for(int i = ; i <= m; ++i) if(i != l && abs(a[i][e]) > eps)

    {

        double r = a[i][e]; a[i][e] = ;

        for(int j = ; j <= p[]; ++j) a[i][p[j]] -= a[l][p[j]] * r;

    }

}

void simplex()

{

    while(true)

    {

        l = e = ;

        for(int i = ; i <= n; ++i) if(a[][i] > eps) { e = i; break; }

        if(!e) break;

        double k = 1e18;

        for(int i = m; i; --i) if(a[i][e] > eps && a[i][] / a[i][e] < k)

        { k = a[i][] / a[i][e]; l = i; }

        if(!l) return;

        pivot(l, e);

    }

    printf("%d", (int)(-a[][] + 0.5));

}

int main()

{

//  freopen("zjoi13_defend.in", "r", stdin);

//  freopen("zjoi13_defend.out", "w", stdout);

    scanf("%d%d", &n, &m);

    for(int i = ; i <= n; ++i) scanf("%lf", &b[][i]);

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

    {

        int l, r; scanf("%d%d%lf", &l, &r, &b[i][]);

        for(int j = l; j <= r; ++j) b[i][j] += 1.0;

    }

    swap(n, m);

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

        for(int j = ; j <= n; ++j) a[i][j] = b[j][i];

    simplex();

//  fclose(stdin); fclose(stdout);

    return ;

}