#include <bits/stdc++.h>
using namespace std;
int n, m, a[100005], C[100105][105], D[105];
vector<pair<int, int> > add[100005], rem[100005];
int main() {
  scanf("%d %d", &n, &m);
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
  for (int i = 0; i <= n + 100; i++)
    for (int j = 0; j <= 100; j++) {
      if (j == 0)
        C[i][j] = 1;
      else if (i == 0)
        C[i][j] = 0;
      else
        C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % 1000000007;
    }
  while (m--) {
    int li, ri, ki;
    scanf("%d %d %d", &li, &ri, &ki);
    li--, ri--;
    add[li].push_back(make_pair(ki, ki));
    rem[ri].push_back(make_pair(ki + ri - li, ki));
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < add[i].size(); j++)
      for (int k = 0; k <= add[i][j].second; k++)
        D[k] = (D[k] + C[add[i][j].first][add[i][j].second - k]) % 1000000007;
    if (i > 0) printf(" ");
    printf("%d", (a[i] + D[0]) % 1000000007);
    for (int j = 0; j < rem[i].size(); j++)
      for (int k = 0; k <= rem[i][j].second; k++)
        D[k] = (D[k] - C[rem[i][j].first][rem[i][j].second - k] + 1000000007) %
               1000000007;
    for (int k = 0; k <= 100; k++) D[k] = (D[k] + D[k + 1]) % 1000000007;
  }
  printf("\n");
  return 0;
}
