Ivan Anatolyevich's agency is starting to become famous in the town. They have already ordered and made n TV commercial videos. Each video is made in a special way: the colors and the soundtrack are adjusted to the time of the day and the viewers' mood. That's why the i -th video can only be shown within the time range of l i , r i (it is not necessary to use the whole segment but the broadcast time should be within this segment). Now it's time to choose a TV channel to broadcast the commercial. Overall, there are m TV channels broadcasting in the city, the j -th one has c j viewers, and is ready to sell time a j , b j to broadcast the commercial. Ivan Anatolyevich is facing a hard choice: he has to choose exactly one video i and exactly one TV channel j to broadcast this video and also a time range to broadcast x , y . At that the time range should be chosen so that it is both within range l i , r i and within range a j , b j . Let's define the efficiency of the broadcast as value ( y - x )· c j — the total sum of time that all the viewers of the TV channel are going to spend watching the commercial. Help Ivan Anatolyevich choose the broadcast with the maximum efficiency ! The first line contains two integers n and m ( 1 ≤ n , m ≤ 2·10 5 ) — the number of commercial videos and channels, respectively. Each of the following n lines contains two integers l i , r i ( 0 ≤ l i ≤ r i ≤ 10 9 ) — the segment of time when it is possible to show the corresponding video. Each of the following m lines contains three integers a j , b j , c j ( 0 ≤ a j ≤ b j ≤ 10 9 , 1 ≤ c j ≤ 10 9 ), characterizing the TV channel. In the first line print an integer — the maximum possible efficiency of the broadcast. If there is no correct way to get a strictly positive efficiency , print a zero. If the maximum efficiency is strictly positive, in the second line also print the number of the video i ( 1 ≤ i ≤ n ) and the number of the TV channel j ( 1 ≤ j ≤ m ) in the