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.
__author__ = 'aste'


def main():
    n = int(input())
    w = [0]*n
    h = [0]*n

    total_width = 0
    for i in range(0, n):
        w[i], h[i] = map(int, input().split())
        total_width += w[i]

    max_h_f = [0]*n
    max_h_b = [0]*n
    for i in range(1, n):
        max_h_f[i] = max(h[i - 1], max_h_f[i - 1])
    for i in range(n - 2, -1, -1):
        max_h_b[i] = max(h[i + 1], max_h_b[i + 1])
    for i in range(0, n):
        max_w = total_width - w[i]
        max_h = max(max_h_f[i], max_h_b[i])
        print((max_w * max_h), end=' ')

main()
