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.
from heapq import *


def lets_do_it():
    n = int(input())
    sum_of_widths = 0
    max_height_heap = []
    width_heights = []

    while n:
        width, height = [int(a) for a in input().split(' ')]
        sum_of_widths += width
        heappush(max_height_heap, -height)
        width_heights.append((width, height))
        n -= 1

    # print(width_heights)
    # print(f'Heap = {max_height_heap}')
    for curr_width, curr_height in width_heights:
        # print(f'curr_wid = {curr_width} | height = {curr_height}')
        width = sum_of_widths - curr_width
        height = -1 * heappop(max_height_heap)
        if height == curr_height:
            height = -1 * heapreplace(max_height_heap, -curr_height)

        print(width * height, end=" ")
        heappush(max_height_heap, -1 * height)


def main():
    # test_cases = int(input())
    test_cases = 1
    while test_cases:
        lets_do_it()
        test_cases -= 1


main()
