#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100000 + 1000, MAXK = 100 + 10, MOD = (int)1e9 + 7;
int n, m, a[MAXN], b[MAXN], fac[MAXN], Ifac[MAXN];
vector<int> l[MAXK], r[MAXK];
int Pow(int a, int b) {
  int d = 1;
  for (; b; d = (b & 1) ? (long long)d * a % MOD : d,
            a = (long long)a * a % MOD, b /= 2)
    ;
  return d;
}
int C(int n, int k) {
  return (long long)fac[n] * Ifac[k] % MOD * Ifac[n - k] % MOD;
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
  for (int i = 1; i <= m; ++i) {
    int first, second, k;
    scanf("%d%d%d", &first, &second, &k);
    l[k].push_back(first), r[k].push_back(second);
  }
  int N = MAXN - 1;
  fac[0] = 1;
  for (int i = 1; i <= N; ++i) fac[i] = (long long)fac[i - 1] * i % MOD;
  Ifac[N] = Pow(fac[N], MOD - 2);
  for (int i = N - 1; i >= 1; --i)
    Ifac[i] = (long long)Ifac[i + 1] * (i + 1) % MOD;
  Ifac[0] = 1;
  for (int k = 100; k >= 0; --k) {
    for (int i = 0; i < (int)l[k].size(); ++i) ++b[l[k][i]], --b[r[k][i] + 1];
    for (int j = k + 1; j <= 100; ++j)
      for (int i = 0; i < (int)l[j].size(); ++i) {
        int L = l[j][i], R = r[j][i];
        if (b[R + 1] < 0) b[R + 1] += MOD;
        b[R + 1] = (b[R + 1] - C((j - k) + (R - L), j - k) + MOD) % MOD;
      }
    for (int i = 1; i <= n; ++i) {
      b[i] = (b[i] + b[i - 1]) % MOD;
      if (b[i] < 0) b[i] += MOD;
    }
  }
  for (int i = 1; i <= n; ++i) printf("%d ", (a[i] + b[i]) % MOD);
  puts("");
  fclose(stdin);
  fclose(stdout);
  return 0;
}
