#include <bits/stdc++.h>
const int inf = 1 << 30;
const long long INF = 1ll << 61;
using namespace std;
const int MOD = 1000000007;
int n, m;
int nnum[100000 + 55];
int C[100000 + 55][100 + 55];
int f[100000 + 55][100 + 55];
int dp[100000 + 55];
void init() {
  for (int i = 0; i < 100000 + 55; ++i) {
    if (i <= 100) C[0][i] = 0;
    C[i][0] = 1;
  }
  for (int i = 1; i < 100000 + 55; ++i) {
    for (int j = 1; j <= min(i, 100); ++j) {
      C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % MOD;
    }
  }
  memset(dp, 0, sizeof(dp));
  memset(f, 0, sizeof(f));
}
bool input() {
  while (cin >> n >> m) {
    for (int i = 1; i <= n; i++) cin >> nnum[i];
    return false;
  }
  return true;
}
int add(int x, int y) {
  x += y;
  if (x >= MOD) x %= MOD;
  if (x < 0) x = (x + MOD) % MOD;
  return x;
}
void cal() {
  int q = m;
  while (q--) {
    int l, r, k;
    scanf("%d %d %d", &l, &r, &k);
    for (int i = 0; i <= k; i++) {
      f[l][i] = add(f[l][i], C[k][k - i]);
      f[r + 1][i] = add(f[r + 1][i], -C[k + r - l + 1][k - i]);
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j <= 100; j++) dp[j] = add(dp[j], f[i][j]);
    nnum[i] = add(nnum[i], dp[0]);
    for (int j = 0; j < 100; j++) dp[j] = add(dp[j], dp[j + 1]);
  }
  for (int i = 1; i <= n; i++) printf("%d%c", nnum[i], i == n ? '\n' : ' ');
}
void output() {}
int main() {
  while (true) {
    init();
    if (input()) return 0;
    cal();
    output();
  }
  return 0;
}
