#include <bits/stdc++.h>
using namespace std;
int n, w[200200], h[200200], W, a[200200], maxH, maxH2, id;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%d%d", &w[i], &h[i]);
    if (h[i] > maxH) {
      maxH = h[i];
      id = i;
    }
    W += w[i];
  }
  for (int i = 1; i <= n; ++i) {
    if (i != id) maxH2 = max(maxH2, h[i]);
  }
  for (int i = 1; i <= n; ++i) {
    if (h[i] == maxH)
      printf("%d ", maxH2 * (W - w[i]));
    else
      printf("%d ", maxH * (W - w[i]));
  }
  return 0;
}
