#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int C = 26;
void add(int &x, int y) {
  x += y;
  while (x >= MOD) x -= MOD;
  while (x < 0) x += MOD;
}
int fix(int x) {
  while (x >= MOD) x -= MOD;
  while (x < 0) x += MOD;
  return x;
}
int pw(int a, int b) {
  int ret = 1;
  while (b) {
    if (b & 1) ret = 1ll * ret * a % MOD;
    b >>= 1;
    a = 1ll * a * a % MOD;
  }
  return ret;
}
const int MAXN = 2e5 + 10;
const int MAXK = 150;
int n, m, a[MAXK][MAXN], in[MAXN];
int binom[MAXN][MAXK];
void plant() {
  for (int i = 0; i < MAXN; i++) {
    binom[i][0] = 1;
    for (int j = 1; j <= min(MAXK - 1, i); j++) {
      binom[i][j] = fix(binom[i - 1][j] + binom[i - 1][j - 1]);
    }
  }
}
void solve() {
  plant();
  cin >> n >> m;
  for (int i = 0; i < n; i++) cin >> in[i];
  for (int rep = 0; rep < m; rep++) {
    int l, r, k;
    cin >> l >> r >> k;
    --l;
    add(a[k][l], 1);
    for (int j = 0; j <= k; j++) {
      add(a[j][r], -binom[r - l - 1 + k - j][k - j]);
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = MAXK - 2; ~j; --j) {
      add(a[j][i], a[j + 1][i]);
      if (i > 0) {
        add(a[j][i], a[j][i - 1]);
      }
    }
    cout << fix(a[0][i] + in[i]) << " ";
  }
  cout << "\n";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int te = 1;
  for (int w = 1; w <= te; w++) {
    solve();
  }
  return 0;
}
