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.
import math
I = lambda: int(input())
tup = lambda: map(int, input().split())
lst = lambda: list(map(int, input().split()))

    
def solve():
    n=I()
    width=[]
    height=[]

    for i in range(n):
        w,h=tup()
        width.append(w)
        height.append(h)
    
    total_width = sum(width)
    answer =[]

    h1,h2=0,0                # max1 and max2 of height
    for i in range(n):
        if height[i]>h1:
            h2=h1
            h1=height[i]


    for i in range(n):
        wid = total_width - width[i]
        if height[i] != h1:
            answer.append(wid*h1)
        else:
            answer.append(wid*h2)
    print(*answer)


# ---------------------------------------------------------------------------------    
t = 1
#t = I()
while t:
    solve()
    t -= 1