#include <bits/stdc++.h>
using namespace std;
const int maxn = 100100 + 5;
const int maxk = 100 + 5;
const int mod = 1000000007;
int a[maxn], C[maxn][maxk], f[maxn][maxk];
int main() {
  int n, m, l, r, k;
  scanf("%d %d", &n, &m);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  C[0][0] = 1;
  for (int i = 1; i <= 100100; ++i)
    for (int j = 0; j <= min(i, 100); ++j)
      C[i][j] = (j != 0) ? (C[i - 1][j] + C[i - 1][j - 1]) % mod : 1;
  for (int i = 1; i <= m; i++) {
    scanf("%d %d %d", &l, &r, &k);
    f[l][k] = (f[l][k] + 1) % mod;
    for (int j = 0, w = k; j <= k; j++, w--)
      f[r + 1][j] = (f[r + 1][j] - C[w + r - l][w] + mod) % mod;
  }
  for (int j = 100; j >= 0; j--)
    for (int i = 1; i <= n; i++)
      f[i][j] = ((f[i][j] + f[i][j + 1]) % mod + f[i - 1][j]) % mod;
  for (int i = 1; i <= n; i++) printf("%d ", (f[i][0] + a[i]) % mod);
  printf("\n");
  return 0;
}
