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.
#include <bits/stdc++.h>

#define endl '\n'

using namespace std;

int n, b, a[200000][2], mx1, mx2, all;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    cin >> n;
    mx1 = 0;
    mx2 = 0;
    for (int i = 0; i < n; i++) {
        cin >> a[i][0] >> b;
        a[i][1] = b;
        if (b >= mx1) {
            mx2 = mx1;
            mx1 = b;
        } else if (b >= mx2) {
            mx2 = b;
        }
        all += a[i][0];
    }
    for (int i = 0; i < n; i++) {
        if (a[i][1] == mx1) {
            cout << (all - a[i][0]) * mx2 << " ";
        } else {
            cout << (all - a[i][0]) * mx1 << " ";

        }
    }

    return 0;
}
