#include <bits/stdc++.h>
using namespace std;
long long step = 10000;
long long tiv[10000] = {};
long long currentIndex = 0;
int main() {
  long long n, m, k;
  cin >> n >> m >> k;
  vector<vector<long long>> stairs(m, vector<long long>(3));
  for (int i = 0; i < m; i++) {
    for (int j = 0; j < 3; j++) {
      cin >> stairs[i][j];
    }
  }
  long long q, S = 0;
  for (int i = 0; i < k; i++) {
    cin >> q;
    for (int j = 0; j < m; j++) {
      if (stairs[j][0] <= q && q <= stairs[j][1]) {
        S += (q - stairs[j][0] + stairs[j][2]);
      }
    }
  }
  cout << S;
  return 0;
}
