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