Problem: You've got an array consisting of n integers: a[1], a[2], ..., a[n]. Moreover, there are m queries, each query can be described by three integers li, ri, ki. Query li, ri, ki means that we should add <image> to each element a[j], where li ≤ j ≤ ri.

Record <image> means the binomial coefficient, or the number of combinations from y elements into groups of x elements.

You need to fulfil consecutively all queries and then print the final array.

Input

The first line contains integers n, m (1 ≤ n, m ≤ 105).

The second line contains n integers a[1], a[2], ..., a[n] (0 ≤ ai ≤ 109) — the initial array.

Next m lines contain queries in the format li, ri, ki — to all elements of the segment li... ri add number <image> (1 ≤ li ≤ ri ≤ n; 0 ≤ k ≤ 100).

Output

Print n integers: the i-th number is the value of element a[i] after all the queries. As the values can be rather large, print them modulo 1000000007 (109 + 7).

Examples

Input

5 1
0 0 0 0 0
1 5 0


Output

1 1 1 1 1


Input

10 2
1 2 3 4 5 0 0 0 0 0
1 6 1
6 10 2


Output

2 4 6 8 10 7 3 6 10 15

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int mod = (int)(1e9 + 7);
const int maxn = 100011;
const int MAXN = 103;
long long f[MAXN][maxn];
int C[maxn][MAXN];
long long a[maxn];
int main() {
  ios::sync_with_stdio(false);
  int n, m, i, j, l, r, k;
  cin >> n >> m;
  for (i = 0; i < maxn; ++i) {
    C[i][0] = 1;
  }
  for (i = 1; i < maxn; ++i) {
    for (j = 1; j < MAXN; ++j) {
      C[i][j] = C[i - 1][j - 1] + C[i - 1][j];
      if (C[i][j] >= mod) C[i][j] -= mod;
    }
  }
  for (i = 1; i <= n; ++i) {
    cin >> a[i];
  }
  int p = 0;
  for (i = 0; i < m; ++i) {
    cin >> l >> r >> k;
    ++f[k + 1][l];
    p = 0;
    for (j = k + 1; j > 0; --j, ++p) {
      f[j][r + 1] += mod - C[r - l + p][p];
    }
  }
  for (j = 100; j >= 0; --j) {
    long long t = 0;
    for (i = 1; i <= n; ++i) {
      t += f[j + 1][i];
      t %= mod;
      f[j][i] += t;
      f[j][i] %= mod;
    }
  }
  for (i = 1; i <= n; ++i) {
    a[i] += f[0][i];
    a[i] %= mod;
    if (i ^ 1) cout << " ";
    cout << a[i];
  }
  cout << endl;
  return 0;
}