Given an array of N(N<=10^5) elements and -10^9<=A*<=10^9. Q(Q<=10^5) queries are there of two types:

- L R K: Add K to all numbers in range [L,R] in array.
- L R: Find no. of positive elements>0 in range [L,R].

I Thought of segment tree with lazy propagation but not able to understand what info to be stored in each node. Please suggest some approach for this problem. @freeloop