#include <bits/stdc++.h>
using namespace std;
const long long inf = 4e18;
const int N = 200000;
const int MOD = 1e9 + 7;
int n, m, a[N], s[N][120], c[N][120];
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  for (int i = 1; i <= n; i++) c[i][0] = 1;
  for (int i = 1; i <= 100; i++) {
    c[1][i] = 1;
    for (int j = 2; j <= n; j++) c[j][i] = (c[j - 1][i] + c[j][i - 1]) % MOD;
  }
  for (int i = 0; i <= 100; i++)
    for (int j = 2; j <= n; j++) c[j][i] = (c[j][i] + c[j - 1][i]) % MOD;
  for (int i = 1; i <= m; i++) {
    int l, r, k;
    scanf("%d%d%d", &l, &r, &k);
    s[l][k] = (s[l][k] + 1) % MOD;
    s[r + 1][k] = (MOD + s[r + 1][k] - 1) % MOD;
    for (int j = k - 1; j >= 0; j--)
      s[r + 1][j] = (MOD + s[r + 1][j] - c[r - l + 1][k - j - 1]) % MOD;
  }
  for (int i = 100; i >= 0; i--) {
    for (int j = 1; j <= n; j++) {
      if (!i) a[j] = (a[j] + s[j][i]) % MOD;
      if (i) s[j][i - 1] = (s[j][i - 1] + s[j][i]) % MOD;
      s[j + 1][i] = (s[j + 1][i] + s[j][i]) % MOD;
    }
  }
  for (int i = 1; i <= n; i++) printf("%d ", a[i]);
  return 0;
}
