B'There are n TV shows you want to watch. Suppose the whole time is split into equal parts called "minutes". The i -th of the shows is going from l_i -th to r_i -th minute, both ends inclusive. You need a TV to watch a TV show and you can 't watch two TV shows which air at the same time on the same TV, so it is possible you will need multiple TVs in some minutes. For example, if segments [l_i, r_i] and [l_j, r_j] intersect, then shows i and j can 't be watched simultaneously on one TV. Once you start watching a show on some TV it is not possible to "move" it to another TV (since it would be too distracting), or to watch another show on the same TV until this show ends. There is a TV Rental shop near you. It rents a TV for x rupees, and charges y ( y < x ) rupees for every extra minute you keep the TV. So in order to rent a TV for minutes [a; b] you will need to pay x + y cdot (b - a) . You can assume, that taking and returning of the TV doesn 't take any time and doesn 't distract from watching other TV shows. Find the minimum possible cost to view all shows. Since this value could be too large, print it modulo 10^9 + 7 . The first line contains integers n , x and y ( 1 <= n <= 10^5 , 1 <= y < x <= 10^9 ) -- the number of TV shows, the cost to rent a TV for the first minute and the cost to rent a TV for every subsequent minute. Each of the next n lines contains two integers l_i and r_i ( 1 <= l_i <= r_i <= 10^9 ) denoting the start and the end minute of the i -th TV show. Print exactly one integer -- the minimum cost to view all the shows taken modulo 10^9 + 7 . In the first example, the optimal strategy would be to rent 3 TVs to watch: This way the cost for the first TV is 4 + 3 cdot (2 - 1) = 7 , for the second is 4 + 3 cdot (10 - 4) = 22 and for the third is 4 + 3 cdot (11 - 2) = 31 , whic'...