#include <bits/stdc++.h>
using namespace std;
const int MaxN = 100000 + 100 + 10, MaxK = 100 + 10, Mod = 1e9 + 7;
int p[MaxK][MaxN], del[MaxK][MaxN], n, m, arr[MaxN], C[MaxN][MaxK];
inline void add(int &num, int v) { num = (num + v) % Mod; }
void init() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; ++i) scanf("%d", &arr[i]);
  C[0][0] = 1;
  for (int i = 1; i <= n + 100; ++i) {
    C[i][0] = 1;
    for (int j = 1; j <= 100; ++j)
      C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % Mod;
  }
}
void solve() {
  int l, r, k;
  for (int i = 1; i <= m; ++i) {
    scanf("%d%d%d", &l, &r, &k);
    l += 100;
    r += 100;
    add(del[k][l - k], 1);
    for (int j = 0; j <= k; ++j)
      add(del[k - j][r - k + 1 + j], -C[r - l + j][j]);
  }
  for (int i = 100; i >= 0; --i)
    for (int j = 1; j <= n + 100; ++j) {
      p[i][j] = (p[i + 1][j - 1] + p[i][j - 1]) % Mod;
      p[i][j] = (p[i][j] + del[i][j]) % Mod;
    }
  for (int i = 1; i <= n; ++i) {
    arr[i] = (arr[i] + p[0][i + 100]) % Mod;
    arr[i] = (arr[i] + Mod) % Mod;
  }
  for (int i = 1; i <= n; ++i) printf("%d ", arr[i]);
}
int main() {
  init();
  solve();
  return 0;
}
