codeforces57B

B. Martian Architecture

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Chris the Rabbit found the traces of an ancient Martian civilization. The brave astronomer managed to see through a small telescope an architecture masterpiece — "A Road to the Sun". The building stands on cubical stones of the same size. The foundation divides the entire "road" into cells, into which the cubical stones are fit tightly. Thus, to any cell of the foundation a coordinate can be assigned. To become the leader of the tribe, a Martian should build a Road to the Sun, that is to build from those cubical stones on a given foundation a stairway. The stairway should be described by the number of stones in the initial coordinate and the coordinates of the stairway's beginning and end. Each following cell in the coordinate's increasing order should contain one cubical stone more than the previous one. At that if the cell has already got stones, they do not count in this building process, the stairways were simply built on them. In other words, let us assume that a stairway is built with the initial coordinate of l, the final coordinate of r and the number of stones in the initial coordinate x. That means that x stones will be added in the cell l, x + 1 stones will be added in the cell l + 1, ..., x + r - l stones will be added in the cell r.

Chris managed to find an ancient manuscript, containing the descriptions of all the stairways. Now he wants to compare the data to be sure that he has really found "A Road to the Sun". For that he chose some road cells and counted the total number of cubical stones that has been accumulated throughout the Martian history and then asked you to count using the manuscript to what the sum should ideally total.

Input

The first line contains three space-separated integers: n, m, k (1 ≤ n, m ≤ 105, 1 ≤ k ≤ min(n, 100)) which is the number of cells, the number of "Roads to the Sun" and the number of cells in the query correspondingly. Each of the following m roads contain three space-separated integers: ai, bi, ci (1 ≤ ai ≤ bi ≤ n, 1 ≤ ci ≤ 1000) which are the stairway's description, its beginning, end and the initial cell's height. Then follow a line, containing k different space-separated integers bi. All these numbers ranging from 1 to n are cells, the number of stones in which interests Chris.

Output

You have to print a single number on a single line which is the sum of stones in all the cells Chris is interested in.

Please, do not use %lld specificator to read or write 64-bit integers in C++. It is preffered to use cin (also you may use %I64d).

Examples

input

5 2 1
1 5 1
2 4 1
3

output

5

input

3 2 1
1 3 1
1 3 1
2

output

4

input

3 2 1
1 3 1
1 3 1
3

output

6

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<list>
#include<vector>
#include<set>
using namespace std;
const int maxn=100010;
long long num[maxn];
struct Node{
    long long a,b,c;
}A[maxn];
bool cmp(Node a,Node b){
    if(a.a==b.b)
        return a.b<b.b;
    return a.a<b.b;
}
int main()
{
    long long n,m,k,i,j;
    scanf("%I64d%I64d%I64d",&n,&m,&k);
    for(i=1;i<=m;++i){
        scanf("%I64d%I64d%I64d",&A[i].a,&A[i].b,&A[i].c);
    }
    for(i=1;i<=k;++i){
        scanf("%I64d%",&num[i]);
    }
    long long ans=0;
    for(i=1;i<=k;++i){
        for(j=1;j<=m;++j){
            if(num[i]>=A[j].a&&num[i]<=A[j].b){
                ans+=num[i]-A[j].a+A[j].c;
            }
        }
    }
    printf("%I64d\n",ans);
    return 0;
}