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())

def solve(n):
    w = []
    h = []
    for i in range(n):
        inp = input().split()
        w.append(int(inp[0]))
        h.append(int(inp[-1]))

    res = []
    sm = sum(w)
    h_mx = sorted(enumerate(h), reverse=True, key=lambda x: x[-1])
    for i in range(n):
        w_ = sm - w[i]
        if i == h_mx[0][0]:
            h_ = h_mx[1][1]
        else:
            h_ = h_mx[0][1]

        res.append(str(w_*h_))

    return ' '.join(res)
print(solve(n))
