#include <bits/stdc++.h>
using namespace ::std;
const long long M = 1000000007;
const int N = 100000, K = 100;
int n, m;
long long a[N + 5];
vector<long long> lq[N + 5], rq[N + 5];
vector<pair<int, int> > qry[K + 5];
long long dp[K + 2][N + 2];
long long c[K + 2][N + 2];
void input() {
  scanf("%d %d", &n, &m);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  for (int i = 0; i < m; i++) {
    int l, r, k;
    scanf("%d %d %d", &l, &r, &k);
    qry[k].push_back(pair<int, int>(l, r));
  }
  for (int i = 0; i <= K; i++)
    for (int j = 0; j <= N; j++) {
      if (i == 0 || j == 0)
        c[i][j] = 1;
      else
        c[i][j] = (c[i - 1][j] + c[i][j - 1]) % M;
    }
}
int main() {
  input();
  for (int i = K; i >= 0; i--) {
    for (int j = K; j >= i; j--) {
      for (int k = 0; k < qry[j].size(); k++) {
        int l = qry[j][k].first, r = qry[j][k].second;
        if (j - i == 0) dp[i][l]++;
        dp[i][r + 1] = (dp[i][r + 1] + M - c[j - i][r - l]) % M;
      }
    }
    for (int j = 1; j <= n; j++)
      dp[i][j] = (dp[i][j] + dp[i + 1][j] + dp[i][j - 1]) % M;
  }
  for (int i = 1; i <= n; i++) printf("%d ", (a[i] + dp[0][i]) % M);
  return 0;
}
