Your friend Hayden is provided with X lists consisting various Y values but there is the simple catch that the values in the list should be greater than A and less than B where A and B denotes some...

Extracted text: Your friend Hayden is provided with X lists consisting various Y values but there is the simple catch that the values in the list should be greater than A and less than B where A and B denotes some integer. You have to find out the minimum number of steps needed to make the dengy value of the all lists equal. Develop a code in C++ to solve the problem. Dengy value is defined as the sum of all values present in the list. Test Case 1: Output: 1 1 4319 11 2 123 124 122