#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 7;
const int maxk = 107;
const long long md = 1e9 + 7;
long long p[maxn][maxk + 1];
long long C[maxn][maxk + 1];
long long A[maxn];
long long B[maxn];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  for (int r = (0); r < (maxn); r++) {
    for (int k = (0); k < (maxk); k++) {
      if (k == 0) {
        C[r][k] = 1;
        continue;
      } else if (r == 0) {
        C[r][k] = 0;
        continue;
      } else {
        C[r][k] = (C[r - 1][k] + C[r - 1][k - 1]) % md;
      }
    }
  }
  int n;
  int m;
  cin >> n >> m;
  for (int i = (0); i < (maxn); i++) {
    for (int j = (0); j < (maxk); j++) {
      p[i][j] = 0;
    }
    B[i] = 0;
  }
  for (int i = (1); i <= (n); i++) {
    cin >> A[i];
  }
  while (m--) {
    int l, r, k;
    cin >> l >> r >> k;
    int m = r - l + 1;
    int v = maxk - 1 - k - 1;
    p[l][v] = (p[l][v] + 1) % md;
    p[r + 1][v] = (p[r + 1][v] - 1 + md) % md;
    for (int i = (v + 1); i <= (v + k); i++) {
      p[r + 1][i] = (p[r + 1][i] - C[m + i - v - 1][i - v] + md) % md;
    }
  }
  for (int k = (1); k <= (maxk - 1); k++) {
    p[0][k] = 0;
    for (int i = (0); i < (n + 5); i++) B[i] = 0;
    for (int i = (1); i <= (n); i++) {
      B[i] = (B[i - 1] + p[i][k - 1]) % md;
      p[i][k] = (B[i] + p[i][k]) % md;
    }
  }
  for (int i = (1); i <= (n); i++) {
    A[i] = (p[i][maxk - 1] + A[i]) % md;
    cout << A[i];
    if (i < n) cout << " ";
  }
  cout << endl;
}
