Problem statement

Given an integer array$($ARR$)$ of size N$,$ the following operations need to be performed:

update$($l$,$ r$,$ val$)$ : Add $($val $+$ i$)$ to arr$[$l $+$ i$]$ where, $0<=$ i $<=$ r $-$ l$.$

rangeSum$($l$,$ r$)$: return the sum of all elements in the array from index l to r$,$ i$.$e$.,$ the sum of array arr$[$l$...$r$].$

Two type of queries denote these operations:

Type $1$: for update$($l$,$ r$,$ val$)$ operation.

Type $2$: for rangeSum$($l$,$ r$)$ operation.

Note: $(1$ based indexing$)$ for the queries.