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.
# -*- coding: utf-8 -*-
"""Untitled0.ipynb

Automatically generated by Colaboratory.

Original file is located at
    https://colab.research.google.com/drive/1_9OVzDPPHfXqUJ4iey71tgQjHg8urO5i
"""

n = input()
n=int(n)

ans = list([0]*200001)
count = list([0]*1001)
maxh = 0
s=0

for i in range(1,n+1):
    w[i],h[i] = input().split
    w[i]=int(w[i])
    h[i]=int(h[i])
    s+=w[i];
    if h[i]>maxh:
        maxh=h[i]
    count[h[i]]+=1;

c=0
s=s*maxh;
if count[maxh]==1:
    j=maxh-1
    c=1;
    while count[j]==0:
        c+=1;
        j=j-1;

for i in range(1,n+1):
    if (h[i]!=maxh) or (count[h[i]]>1):
        print(s-w[i]*maxh)
    else:
        print(s-w[i]*maxh-c*(s // maxh)+w[i]*c)