title: Can Lazy propogation be implemented for division queries?
body: <p>How can lazy propogation be implemented for segment tree in which we have two types of queries, one for finding maximum element in a given range and other is to divide elements in a given range by a number( not necessarily same for all elements like maybe each element is divided by its smallest odd factor or something of that sort)?</p>