#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 7;
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 1e9 + 7;
int n, m;
long long a[N], b[N][107], inv[N], f[N], finv[N];
void init() {
  inv[1] = f[0] = finv[0] = 1;
  for (int i = 2; i < N; i++) inv[i] = (mod - mod / i) * inv[mod % i] % mod;
  for (int i = 1; i < N; i++) f[i] = f[i - 1] * i % mod;
  for (int i = 1; i < N; i++) finv[i] = finv[i - 1] * inv[i] % mod;
}
long long comb(int n, int m) {
  if (n < 0 || n < m) return 0;
  return f[n] * finv[m] % mod * finv[n - m] % mod;
}
inline void add(long long &a, long long b) {
  a += b;
  if (a >= mod) a -= mod;
}
int main() {
  init();
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) scanf("%lld", &a[i]);
  while (m--) {
    int l, r, k;
    scanf("%d%d%d", &l, &r, &k);
    add(b[l][k + 1], 1);
    for (int j = k + 1; j >= 1; j--)
      add(b[r + 1][j], mod - comb(r - l + k + 1 - j, k + 1 - j));
  }
  for (int j = 100; j >= 0; j--) {
    long long s = 0;
    for (int i = 1; i <= n; i++) {
      add(s, b[i][j + 1]);
      add(b[i][j], s);
    }
  }
  for (int i = 1; i <= n; i++) printf("%lld ", (b[i][0] + a[i]) % mod);
  puts("");
  return 0;
}
