func_code_string: #include <bits/stdc++.h>   const long long RXD = 1e9 + 7;   const long long N = 1e5 + 1000;   using namespace std;   long long C[N][110], a[N], s[N][110], n, m, l, r, K;   long long read() {     long long x = 0, f = 1, c = getchar();     while (c <  0  || c >  9 ) {       if (c ==  - ) f = -1;       c = getchar();     }     while (c >=  0  && c <=  9 ) x = x * 10 + c -  0 , c = getchar();     return x * f;   }   int main() {     C[0][0] = 1;     for (long long i = 1; i <= 100100; i++)       for (long long j = 0; j <= i && j <= 105; j++)         C[i][j] = (j == 0) ? 1 : (C[i - 1][j] + C[i - 1][j - 1]) % RXD;     n = read();     m = read();     for (long long i = 1; i <= n; i++) a[i] = read();     for (long long i = 1; i <= m; i++) {       l = read();       r = read();       K = read();       for (long long i = 0; i <= K; i++) s[l][i] = (s[l][i] + C[K][K - i]) % RXD;       for (long long i = 0; i <= K; i++)         s[r + 1][i] = (s[r + 1][i] - C[K + r + 1 - l][K - i] + RXD) % RXD;     }     for (long long i = 1; i <= n; i++)       for (long long j = 101; j; j--)         s[i + 1][j - 1] = ((s[i + 1][j - 1] + s[i][j]) % RXD + s[i][j - 1]) % RXD;     for (long long i = 1; i <= n; i++)       printf( %d  , ((a[i] + s[i][0]) % RXD + RXD) % RXD);   }   