Little Alyona is celebrating Happy Birthday! Her mother has an array of n flowers. Each flower has some mood, the mood of i-th flower is ai. The mood can be positive, zero or negative.
Let's define a subarray as a segment of consecutive flowers. The mother suggested some set of subarrays. Alyona wants to choose several of the subarrays suggested by her mother. After that, each of the flowers will add to the girl's happiness its mood multiplied by the number of chosen subarrays the flower is in.
For example, consider the case when the mother has 5 flowers, and their moods are equal to 1,-2,1,3,-4. Suppose the mother suggested subarrays (1,-2), (3,-4), (1,3), (1,-2,1,3). Then if the girl chooses the third and the fourth subarrays then:
Thus, in total 1+(-2)+2+6+0=7 is added to the girl's happiness. Alyona wants to choose such subarrays from those suggested by the mother that the value added to her happiness would be as large as possible. Help her do this!
Alyona can choose any number of the subarrays, even 0 or all suggested by her mother.
The first line contains two integers n and m (1≤n,m≤100)− the number of flowers and the number of subarrays suggested by the mother.
The second line contains the flowers moods− n integers a1,a2,...,an (-100≤ai≤100).
The next m lines contain the description of the subarrays suggested by the mother. The i-th of these lines contain two integers li and ri (1≤li≤ri≤n) denoting the subarray a[li],a[li+1],...,a[ri].
Each subarray can encounter more than once.
Print single integer− the maximum possible value added to the Alyona's happiness.
5 4
1 -2 1 3 -4
1 2
4 5
3 4
1 4
7
4 3
1 2 3 4
1 3
2 4
1 1
16
2 2
-1 -2
1 1
1 2
0
The first example is the situation described in the statements.
In the second example Alyona should choose all subarrays.
The third example has answer 0 because Alyona can choose none of the subarrays.