Portals

Portals

You are standing at the first index of an array $a$ of length $n$. At index $i$, you can either take a step forward to $i+1$, or if there is a portal ($m$ portals) $x,y,z$ such that $x \le i \le y$, you can teleport to index $z$. The score of a path is defined as the sum of values of the indicies you visit. What is the maximum score with which you can get from index $0$ to index $n-1$?

Input Format

The first line is two integers n m, the number of numbers and portals. The next line is n integers, the array. The next m lines are each three integers x y z, the portals.

Sample Input

5 1
1 2 -100 4 5
1 1 3

Sample Output

12

Constraints

$1 \le n \le 1e5$

$1 \le m \le 1e5$

$-1e3 \le a[i] \le 1e3$

$0 \le x \le y < z < n$