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
# a, b = map(int, input().split())
# a = list(map(int, input().split()))
n = int(input())
stack = []
for i in range(0,n):
    w, h = map(int, input().split())
    stack.append([w,h])
totalw = 0
maxh = 0
max2thh = 0
#print(stack)
stack2 = []
for i in range(0,n):
    totalw += stack[i][0]
    if maxh < stack[i][1]:
        maxh = stack[i][1]
    else:
        if stack[i][1] > max2thh:
            max2thh = stack[i][1]
#print(totalw,maxh,max2thh)
for i in range(0,n):
    ans1 = totalw - stack[i][0]
    if stack[i][1] == maxh:
        ans2 = max2thh
    else:
        ans2 = maxh
    stack2.append(str(ans1*ans2))
print(" ".join(stack2))