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.
n=int(input())
w=[]
h=[]
for i in range(0,n):
    y,z=map(int,input().split())
    w.append(y)
    h.append(z)
s=0
for i in w:
    s=s+i
p_max=[]
m=0
for i in range(0,n):
    if h[i]>m:
        m=h[i]
        p_max.append(m)
    else:
        p_max.append(m)
m=0
s_max=[]
for i in range(n-1,-1,-1):
    if h[i]>m:
        m=h[i]
        s_max.append(m)
    else:
        s_max.append(m)
s_max.reverse()
ans=""
for i in range(0,n):
    if i==0:
        h=(s-w[i])*s_max[1]
        ans=ans+str(h)+" "
    elif i==n-1:
        h=(s-w[i])*p_max[n-2]
        ans=ans+str(h)+" "
    else:
        g=max(p_max[i-1],s_max[i+1])
        h=(s-w[i])*g
        ans=ans+str(h)+" "
print(ans)