#include <bits/stdc++.h>
using namespace std;
const int INF = (int)2e9;
const long long INFL = (long long)9e18;
const int MAXINT = ((~0) ^ (1 << 31));
const long long MAXLL = ((~0) ^ ((long long)1 << 63));
template <class T>
inline T pow2(T a) {
  return a * a;
}
template <class T>
inline bool mineq(T& a, T b) {
  return (a > b) ? (a = b, true) : false;
}
template <class T>
inline bool maxeq(T& a, T b) {
  return (a < b) ? (a = b, true) : false;
}
const int maxn = (int)2e5 + 10;
;
long long num[maxn], n, sum, mx, mx2, h[maxn];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  for (int i = 0; i < (int)(n); i++) {
    cin >> num[i] >> h[i];
    sum += num[i];
    if (h[i] > mx) {
      mx2 = mx;
      mx = h[i];
    } else
      maxeq(mx2, h[i]);
  }
  for (int i = 0; i < (int)(n); i++) {
    cout << (h[i] == mx ? (sum - num[i]) * mx2 : (sum - num[i]) * mx) << " ";
  }
}
