#include <bits/stdc++.h>
using namespace std;
const double pi = acos(0.0) * 2.0;
const double eps = 1e-12;
const int step[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
template <class T>
inline T abs1(T a) {
  return a < 0 ? -a : a;
}
template <class T>
inline T max1(T a, T b, T c = -1234567, T d = -1234567) {
  T ans = a > b ? a : b;
  if (c != -1234567) ans = max1(ans, c);
  if (d != -1234567) ans = max1(ans, d);
  return ans;
}
template <class T>
inline T min1(T a, T b, T c = -1234567, T d = -1234567) {
  T ans = a < b ? a : b;
  if (c != -1234567) ans = min(ans, c);
  if (d != -1234567) ans = min(ans, d);
  return ans;
}
template <class T>
inline T gcd1(T a, T b) {
  if (a < b) swap(a, b);
  if (a % b == 0) return b;
  return gcd1(b, a % b);
}
template <class T>
inline T lb(T num) {
  return num & (-num);
}
inline int jud(double a, double b) {
  if (abs1(a - b) < eps) return 0;
  if (a < b) return -1;
  return 1;
}
template <typename it, typename t1>
inline int find(t1 val, it a, int na, bool f_small = 1, bool f_lb = 1) {
  if (na == 1) return 0;
  int be = 0, en = na - 1;
  if (*a <= *(a + na - 1)) {
    if (f_lb == 0)
      while (be < en) {
        int mid = (be + en + 1) / 2;
        if (jud(*(a + mid), val) != 1)
          be = mid;
        else
          en = mid - 1;
      }
    else
      while (be < en) {
        int mid = (be + en) / 2;
        if (jud(*(a + mid), val) != -1)
          en = mid;
        else
          be = mid + 1;
      }
    if (f_small && jud(*(a + be), val) == 1 && be != 0) be--;
    if (!f_small && jud(*(a + be), val) == -1 && be != na - 1) be++;
  } else {
    if (f_lb)
      while (be < en) {
        int mid = (be + en + 1) / 2;
        if (jud(*(a + mid), val) != -1)
          be = mid;
        else
          en = mid - 1;
      }
    else
      while (be < en) {
        int mid = (be + en) / 2;
        if (jud(*(a + mid), val) != 1)
          en = mid;
        else
          be = mid + 1;
      }
    if (!f_small && jud(*(a + be), val) == -1 && be != 0) be--;
    if (f_small && jud(*(a + be), val) == 1 && be != na - 1) be++;
  }
  return be;
}
inline int bitnum(unsigned long long nValue) {
  nValue = ((0xaaaaaaaaaaaaaaaaull & nValue) >> 1) +
           (0x5555555555555555ull & nValue);
  nValue = ((0xccccccccccccccccull & nValue) >> 2) +
           (0x3333333333333333ull & nValue);
  nValue = ((0xf0f0f0f0f0f0f0f0ull & nValue) >> 4) +
           (0x0f0f0f0f0f0f0f0full & nValue);
  nValue = ((0xff00ff00ff00ff00ull & nValue) >> 8) +
           (0x00ff00ff00ff00ffull & nValue);
  nValue = ((0xffff0000ffff0000ull & nValue) >> 16) +
           (0x0000ffff0000ffffull & nValue);
  nValue = ((0xffffffff00000000ull & nValue) >> 32) +
           (0x00000000ffffffffull & nValue);
  return nValue;
}
long long pow(long long n, long long m, long long mod = 0) {
  long long ans = 1;
  long long k = n;
  while (m) {
    if (m & 1) {
      ans *= k;
      if (mod) ans %= mod;
    }
    k *= k;
    if (mod) k %= mod;
    m >>= 1;
  }
  return ans;
}
const int maxn = 110100;
long long n, m, lt;
struct node {
  long long cate, no, t;
  inline bool operator<(const node &a) const { return t < a.t; }
} t[maxn * 5];
struct node1 {
  int cate, t, val, no;
  bool operator<(const node1 &a) const { return a.t < t; }
} orig[maxn * 2];
bool f[maxn * 2];
priority_queue<node1> pq;
bool cmp(const node1 &a, const node1 &b) { return a.val < b.val; }
long long sum, cnt, sum1;
long long ans[maxn];
int main() {
  scanf("%I64d%I64d", &n, &m);
  for (int i = 0; i < m; i++) {
    long long a, b, c;
    scanf("%I64d%I64d%I64d", &a, &b, &c);
    orig[i * 2].cate = 0;
    orig[i * 2].val = a;
    orig[i * 2].t = c;
    orig[i * 2].no = i;
    orig[i * 2 + 1].cate = 1;
    orig[i * 2 + 1].val = b;
    orig[i * 2 + 1].t = c;
    orig[i * 2 + 1].no = i;
  }
  sort(orig, orig + m * 2, cmp);
  long long last = orig[0].val;
  for (int i = 0; i < m * 2; i++) {
    while (pq.size() && f[pq.top().no]) pq.pop();
    if (pq.size() && last != orig[i].val) {
      t[lt].cate = 1;
      t[lt++].t = last - pq.top().t;
      t[lt].cate = 2;
      t[lt++].t = orig[i].val - pq.top().t;
    }
    if (orig[i].cate == 0) pq.push(orig[i]);
    if (orig[i].cate == 1) f[orig[i].no] = 1;
    last = orig[i].val;
  }
  for (int i = 0; i < n; i++) {
    scanf("%I64d", &t[lt].t);
    t[lt].no = i;
    t[lt++].t = -t[lt].t;
  }
  sort(t, t + lt);
  long long lastt = 0;
  for (int i = lt - 1; i >= 0; i--) {
    sum += cnt * (lastt - t[i].t);
    if (t[i].cate == 2) cnt++;
    if (t[i].cate == 1) cnt--;
    if (t[i].cate == 0) ans[t[i].no] = sum;
    lastt = t[i].t;
  }
  for (int i = 0; i < n; i++) cout << ans[i] << endl;
  return 0;
}
