#include <bits/stdc++.h>
using namespace std;
const int modl = 1e9 + 7;
int n, m;
int a[100010];
int update[100010][110], red[100010][110];
int C[100010][110];
int main() {
  for (int i = 0; i <= 100000; i++) {
    for (int j = 0; j <= 100; j++)
      if (!i || !j)
        C[i][j] = 1;
      else
        C[i][j] = (C[i - 1][j] + C[i][j - 1]) % modl;
  }
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) scanf("%d", a + i);
  for (int i = 1; i <= m; i++) {
    int l, r, k;
    scanf("%d%d%d", &l, &r, &k);
    update[l][100 - k] = (update[l][100 - k] + 1) % modl;
    for (int j = 0; j <= k; j++)
      red[r + 1][100 - k + j] =
          (red[r + 1][100 - k + j] + C[r - l + 1][j]) % modl;
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j <= 100; j++) {
      update[i][j] = (update[i][j] + update[i - 1][j]) % modl;
      if (j) update[i][j] = (update[i][j] + update[i][j - 1]) % modl;
    }
    for (int j = 0; j <= 100; j++) update[i][j] = (update[i][j] - red[i][j]);
    a[i] = (a[i] + update[i][100]) % modl;
    if (a[i] < 0) a[i] += modl;
    printf("%d ", a[i]);
  }
  return 0;
}
