#include <bits/stdc++.h>
using namespace std;
const int M = 110;
const int N = 101000 + M;
const int MOD = (int)1e9 + 7;
int a[N], F[N], Finv[N], Inv[N], n, m, Array[N][M];
void init() {
  Inv[1] = 1;
  F[0] = Finv[0] = 1;
  for (int i = 2; i < N; i++) {
    Inv[i] = (long long)Inv[MOD % i] * (MOD - MOD / i) % MOD;
  }
  for (int i = 1; i < N; i++) {
    F[i] = (long long)F[i - 1] * i % MOD;
    Finv[i] = (long long)Finv[i - 1] * Inv[i] % MOD;
  }
}
int C(int a, int b) {
  if (a < b) return 0;
  return (long long)F[a] * Finv[b] % MOD * Finv[a - b] % MOD;
}
int main() {
  init();
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
  for (int i = 0; i < m; i++) {
    int l, r, K;
    scanf("%d%d%d", &l, &r, &K);
    l--;
    (Array[l][K] += 1) %= MOD;
    int val = 1;
    for (int j = K; j >= 0; j--) {
      (Array[r][j] -= val) %= MOD;
      val = (long long)val * (r - l + K - j) % MOD * Inv[K - j + 1] % MOD;
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 100; j >= 0; j--) {
      if (i) (Array[i][j] += Array[i - 1][j]) %= MOD;
      if (j != 100) (Array[i][j] += Array[i][j + 1]) %= MOD;
    }
    printf("%d\n", ((a[i] + Array[i][0]) % MOD + MOD) % MOD);
  }
  return 0;
}
