#include <bits/stdc++.h>
#pragma GCC optimize("Ofast", "inline", "-ffast-math")
#pragma GCC target("avx,sse2,sse3,sse4,mmx")
using namespace std;
template <class T>
inline void read(T &x) {
  int f = 0, ch = 0;
  x = 0;
  for (; !isdigit(ch); ch = getchar())
    if (ch == '-') f = 1;
  for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - 48;
  if (f) x = -x;
}
const long long N = 200005, Mod = 1e9 + 7;
long long js[N], inv[N], a[N][105], n, m;
inline long long Pow(long long a, long long b) {
  long long ans = 1;
  for (; b; b >>= 1, a = 1ll * a * a % Mod)
    if (b & 1) ans = 1ll * ans * a % Mod;
  return ans;
}
inline long long C(long long x, long long y) {
  return js[x] * inv[y] % Mod * inv[x - y] % Mod;
}
signed main() {
  js[0] = inv[0] = 1;
  for (long long i = 1; i < N; i++)
    js[i] = 1ll * js[i - 1] * i % Mod, inv[i] = Pow(js[i], Mod - 2);
  read(n), read(m);
  for (long long i = 1; i <= n; i++) read(a[i][0]);
  for (long long i = 1, l, r, k; i <= m; i++) {
    read(l), read(r), read(k), a[l][k + 1]++;
    for (long long j = 1; j <= k + 1; j++)
      (a[r + 1][j] -= C(r - l + k - j + 1, k - j + 1)) %= Mod;
  }
  for (long long i = 101; i >= 0; i--) {
    long long s = 0;
    for (long long j = 1; j <= n; j++) {
      (s += a[j][i + 1]) %= Mod;
      (a[j][i] += s) %= Mod;
    }
  }
  for (long long i = 1; i <= n; i++)
    printf("%lld ", (a[i][0] % Mod + Mod) % Mod);
  return 0;
}
