func_code_string: #include <bits/stdc++.h>   using namespace std;   using ll = long long;   int const N = 1e5 + 86;   int const M = 1e9 + 7;   int a[N], f[111][N];   ll ext_gcd(ll a, ll b, ll &x, ll &y) {     if (!b) {       x = 1, y = 0;       return a;     }     ll ret = ext_gcd(b, a % b, x, y);     ll t = x;     x = y, y = t - a / b * y;     return ret;   }   ll mod_inv(ll a, ll n) {     ll x, y;     ext_gcd(a, n, x, y);     x %= n;     if (x < 0) x += n;     return x;   }   void add(int &x, int y) {     x += y;     if (x >= M) x -= M;   }   int main() {     int n, m;     scanf( %d%d , &n, &m);     for (int i = 0; i < n; ++i) scanf( %d , a + i);     for (int l, r, k; m--;) {       scanf( %d%d%d , &l, &r, &k), --l, --r;       add(f[k][l], 1), add(f[k][r + 1], M - 1);       ll c = 1, m = r - l + 1;       for (int i = 1; i <= k; ++i, ++m) {         c = c * m % M;         c = c * mod_inv(i, M) % M;         add(f[k - i][r + 1], M - c);       }     }     for (int i = 100; i >= 0; --i) {       for (int j = 1; j < n; ++j) add(f[i][j], f[i][j - 1]);       for (int j = 0; i && j < n; ++j) add(f[i - 1][j], f[i][j]);     }     for (int i = 0; i < n; ++i) add(a[i], f[0][i]);     for (int i = 0; i < n; ++i) printf( %d%s , a[i], i == n - 1 ?   n  :    );     return 0;   }   