CF407C Curious Array

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 $ l_{i},r_{i},k_{i} $ . Query $ l_{i},r_{i},k_{i} $ means that we should add  to each element $ a[j] $ , where $ l_{i}

The first line contains integers $ n $ , $ m $ ( $ 1

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 $ $ (10^{9}+7) $ .