#include <bits/stdc++.h>
using namespace std;
const double eps(1e-8);
long long c[100110][110], f[110][100010];
long long a[100010];
int n;
int main() {
  for (int i = 0; i <= 100000; i++)
    for (int j = 0; j <= min(100, i); j++)
      c[i][j] = (j == 0) ? 1 : (c[i - 1][j - 1] + c[i - 1][j]) % 1000000007LL;
  scanf("%d", &n);
  int m;
  scanf("%d", &m);
  for (int i = 1; i <= n; i++) scanf("%I64d", &a[i]);
  int l, r, k;
  while (m--) {
    scanf("%d%d%d", &l, &r, &k);
    f[k][l]++;
    for (int i = 0; i <= k; i++) {
      int d = k - i;
      f[i][r + 1] = (f[i][r + 1] - c[r - l + d][d]) % 1000000007LL;
    }
  }
  for (int i = 100; i >= 0; i--)
    for (int j = 1; j <= n; j++)
      f[i][j] = (f[i][j] + f[i][j - 1] + f[i + 1][j]) % 1000000007LL;
  for (int i = 1; i <= n; i++) {
    long long tmp = (f[0][i] + a[i]) % 1000000007LL;
    tmp = (tmp + 1000000007LL) % 1000000007LL;
    printf("%I64d%c", tmp, (i == n) ? 10 : ' ');
  }
  return 0;
}
