#include <bits/stdc++.h>
using namespace std;
const int Mo = 1000000007;
struct str {
  int l, r, k;
} ask[100100];
int i, j, l, m, n, k, mk, cl;
int C[100100 << 2][110], js[100100], bg[100100];
bool cmp(const str &a, const str &b) { return (a.k > b.k); }
int main() {
  scanf("%d %d", &n, &m);
  for (i = 1; i <= n; i++) scanf("%d", &bg[i]);
  for (i = 1; i <= m; i++) {
    scanf("%d %d %d", &ask[i].l, &ask[i].r, &ask[i].k);
    mk = max(ask[i].k, mk);
  }
  for (i = 0; i <= (n << 2) + mk; i++) {
    C[i][0] = 1;
    for (j = 1; j <= min(mk, i); j++)
      C[i][j] = C[i - 1][j] + C[i - 1][j - 1], C[i][j] %= Mo;
  }
  for (cl = mk; cl >= 0; cl--) {
    for (i = 1; i <= m; i++)
      if (ask[i].k == cl) js[ask[i].l]++, js[ask[i].r + 1]--;
    for (i = 1; i <= m; i++)
      if (ask[i].k > cl)
        (js[ask[i].r + 1] -=
         C[ask[i].r - ask[i].l + ask[i].k - cl][ask[i].k - cl]) %= Mo;
    for (i = 1; i <= n; i++) js[i] += js[i - 1], js[i] %= Mo;
  }
  for (i = 1; i <= n; i++) printf("%d ", ((bg[i] + js[i]) % Mo + Mo) % Mo);
  return 0;
}
