Implementation of Lazy Segment Tree data structure with the following operations:
int query(int w, int x, int y, int b, int e)– returns the sum of elements in range [x, y].void add(int w, int x, int y, int b, int e, int v)– add v to all elements in range [x, y].