#include <bits/stdc++.h>
using namespace std;
struct lest {
  int start, finish, begin;
  lest() {}
  void scan() { cin >> start >> finish >> begin; }
  int kol(int i) {
    if (start <= finish) {
      if (i < start || i > finish) return 0;
      return i - start + begin;
    } else {
      if (i < finish || i > start) return 0;
      return start - i + begin;
    }
  }
};
lest l[100100];
int main() {
  int n, m, k, t;
  cin >> n >> m >> k;
  for (int i = 0; i < m; ++i) l[i].scan();
  long long sum = 0;
  for (int i = 0; i < k; ++i) {
    cin >> t;
    for (int j = 0; j < m; ++j) sum += l[j].kol(t);
  }
  cout << sum;
  return 0;
}
