#include <bits/stdc++.h>
using namespace std;
struct seg {
  int l, r;
};
list<seg> L[101];
int nCr[100205][102];
int arr[100005], diff[100005], n, m;
int main() {
  for (int i = 0; i <= 100200; i++) {
    for (int j = 0; j <= 100 && j <= i; j++) {
      if (j == 0 || j == i)
        nCr[i][j] = 1;
      else
        nCr[i][j] = (nCr[i - 1][j] + nCr[i - 1][j - 1]) % 1000000007;
    }
  }
  scanf("%d %d", &n, &m);
  for (int i = 1; i <= n; i++) scanf("%d", &arr[i]);
  for (int i = 1; i <= m; i++) {
    int s, e, k;
    scanf("%d %d %d", &s, &e, &k);
    L[k].push_back((seg){s, e});
  }
  memset(diff, 0, sizeof(diff));
  for (int i = 100; i >= 0; i--) {
    for (list<seg>::iterator it = L[i].begin(); it != L[i].end(); it++) {
      seg tmp = *it;
      diff[tmp.l]++;
    }
    for (int j = i; j <= 100; j++) {
      for (list<seg>::iterator it = L[j].begin(); it != L[j].end(); it++) {
        seg tmp = *it;
        diff[tmp.r + 1] -= nCr[tmp.r - tmp.l + j - i][j - i];
        if (diff[tmp.r + 1] < 0) diff[tmp.r + 1] += 1000000007;
      }
    }
    for (int j = 1; j <= n + 1; j++) {
      diff[j] += diff[j - 1];
      diff[j] %= 1000000007;
      if (diff[j] < 0) diff[j] += 1000000007;
    }
  }
  for (int j = 1; j <= n; j++) {
    arr[j] = (arr[j] + diff[j]) % 1000000007;
    if (arr[j] < 0) arr[j] += 1000000007;
    printf("%d%c", arr[j], j == n ? '\n' : ' ');
  }
  return 0;
}
