One day *n* friends met at a party, they hadn't seen each other for a long time and so they decided to make a group photo together. 

Simply speaking, the process of taking photos can be described as follows. On the photo, each photographed friend occupies a rectangle of pixels: the *i*-th of them occupies the rectangle of width *w*<sub class="lower-index">*i*</sub> pixels and height *h*<sub class="lower-index">*i*</sub> pixels. On the group photo everybody stands in a line, thus the minimum pixel size of the photo including all the photographed friends, is *W* × *H*, where *W* is the total sum of all widths and *H* is the maximum height of all the photographed friends.

As is usually the case, the friends made *n* photos — the *j*-th (1 ≤ *j* ≤ *n*) photo had everybody except for the *j*-th friend as he was the photographer.

Print the minimum size of each made photo in pixels.
The first line contains integer *n* (2 ≤ *n* ≤ 200 000) — the number of friends. 

Then *n* lines follow: the *i*-th line contains information about the *i*-th friend. The line contains a pair of integers *w*<sub class="lower-index">*i*</sub>, *h*<sub class="lower-index">*i*</sub> (1 ≤ *w*<sub class="lower-index">*i*</sub> ≤ 10, 1 ≤ *h*<sub class="lower-index">*i*</sub> ≤ 1000) — the width and height in pixels of the corresponding rectangle.
def max_h_excpet_that(arr, i):
    max_h = 0
    for j in range(len(arr)):
        if j != i:
            max_h = max(max_h, arr[j])
    return max_h


n = int(input())
w_arr = []
h_arr = []

for i in range(1,n+1):
    w,h = map(int,input().split(" "))
    if i != 1:
        for j in range(0,len(w_arr)):
            w_arr[j] += w
    w_arr.append(w)
    h_arr.append(h)

w_arr.append(0)
print(w_arr, h_arr)

for i in range(1,len(w_arr)):
    print((w_arr[i]+(w_arr[0]-w_arr[i-1]))*max_h_excpet_that(h_arr, i-1), end=" ")