#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 1000;
const long long mo = 1e9 + 7;
long long c[N][110], b[N][110], a[N], s[N];
void pr() {
  c[0][0] = 1;
  for (int i = 1; i < 100105; i++) {
    c[i][0] = 1;
    for (int j = 1; j < 105; j++)
      c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mo;
  }
}
int main() {
  pr();
  int n, m, l, r, k;
  scanf("%d%d", &n, &m);
  for (int i = 1; i < n + 1; i++) scanf("%I64d", a + i);
  for (int i = 0; i < m; i++) {
    scanf("%d%d%d", &l, &r, &k);
    for (int j = 1; j < k + 2; j++)
      b[r + 1][j] = (b[r + 1][j] - c[r - l + k - j + 1][k - j + 1] + mo) % mo;
    b[l][k + 1] = (b[l][k + 1] + 1) % mo;
  }
  for (int i = 100; i > -1; i--) {
    s[0] = 0;
    for (int j = 1; j < n + 1; j++) {
      s[j] = (s[j - 1] + b[j][i + 1]) % mo;
      b[j][i] = (b[j][i] + s[j]) % mo;
    }
  }
  for (int i = 1; i < n + 1; i++) a[i] = (a[i] + b[i][0]) % mo;
  for (int i = 1; i < n; i++) printf("%I64d ", a[i]);
  printf("%I64d\n", a[n]);
  return 0;
}
