#include <bits/stdc++.h>
using namespace std;
template <class T>
void read(T &x) {
  int f = 0;
  x = 0;
  char ch = getchar();
  for (; !isdigit(ch); ch = getchar()) f |= (ch == '-');
  for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - '0';
  if (f) x = -x;
}
const int N = 200005, M = 105, mod = 1e9 + 7;
int fac[N], rev[N], f[N][M], a[N], n, m, l, r, k;
int power(int x, int p) {
  int res = 1;
  for (; p; p >>= 1, x = (long long)x * x % mod)
    if (p & 1) res = (long long)res * x % mod;
  return res;
}
void add(int &x, int y) { x = (x + y >= mod ? x + y - mod : x + y); }
void init(int n) {
  fac[0] = 1;
  for (int i = (1); i <= (n); i++) fac[i] = (long long)fac[i - 1] * i % mod;
  rev[n] = power(fac[n], mod - 2);
  for (int i = (n); i >= (1); i--) rev[i - 1] = (long long)rev[i] * i % mod;
}
int C(int n, int m) {
  return m < 0 || m > n ? 0
                        : (long long)fac[n] * rev[m] % mod * rev[n - m] % mod;
}
int main() {
  read(n), read(m), init(n + 100);
  for (int i = (1); i <= (n); i++) read(a[i]);
  while (m--) {
    read(l), read(r), read(k);
    for (int i = (0); i <= (k); i++) {
      add(f[l][i], C(k, k - i));
      add(f[r + 1][i], mod - C(k + r - l + 1, k - i));
    }
  }
  for (int i = (1); i <= (n); i++) {
    for (int j = (0); j <= (100); j++) {
      add(f[i + 1][j], f[i][j]);
      if (j) add(f[i + 1][j - 1], f[i][j]);
    }
    add(a[i], f[i][0]);
  }
  for (int i = (1); i <= (n); i++) {
    printf("%d%c", a[i], " \n"[i == n]);
  }
  return 0;
}
