#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
long long n, m;
long long a[110000];
long long sum[110][110000];
long long C[110000][110];
long long add(long long x, long long y) {
  long long sum = x + y;
  if (sum >= mod) return sum - mod;
  return sum;
}
long long dec(long long x, long long y) {
  long long ans = x - y;
  if (ans < 0) ans += mod;
  return ans;
}
int main() {
  C[0][0] = 1;
  C[1][0] = C[1][1] = 1;
  for (long long i = 2; i <= 100000; i++) {
    C[i][0] = 1;
    C[i][i] = 1;
    for (long long j = 1; j <= min(i - 1, 100LL); j++) {
      C[i][j] = C[i - 1][j] + C[i - 1][j - 1];
      if (C[i][j] > mod) C[i][j] -= mod;
    }
  }
  long long mx = 0;
  scanf("%lld%lld", &n, &m);
  for (long long i = 1; i <= n; i++) scanf("%lld", &a[i]);
  for (long long i = 1; i <= m; i++) {
    long long l, r, k;
    scanf("%lld%lld%lld", &l, &r, &k);
    mx = max(mx, k);
    sum[k][l]++;
    if (sum[k][l] > mod) sum[k][l] -= mod;
    for (long long j = k; j >= 0; j--)
      sum[j][r + 1] = dec(sum[j][r + 1], C[r - l + k - j][k - j]);
  }
  for (long long i = mx; i >= 0; i--) {
    for (long long j = 1; j <= n; j++)
      sum[i][j + 1] = add(sum[i][j + 1], sum[i][j]);
    if (i > 0)
      for (long long j = 1; j <= n + 1; j++)
        sum[i - 1][j] = add(sum[i - 1][j], sum[i][j]);
  }
  for (long long i = 1; i <= n; i++) cout << add(a[i], sum[0][i]) << " ";
  return 0;
}
