/*

xi+yj<xj+yi

xi-yi<xj-yj

xi-yi值小取xi

xi-yi值大取yi

*/

#include<bits/stdc++.h>

using namespace std;

#define ll long long

#define N 300005

struct Node {

    ll x,y,id;

}p[N],q[N];

int n,m;

ll ans[N],sumx[N],sumy[N];

int cmp(Node a,Node b){return a.x-a.y<b.x-b.y;}

int main(){

    cin>>n>>m;

    for(int i=;i<=n;i++)

        scanf("%lld%lld",&p[i].x,&p[i].y),p[i].id=i;

    for(int i=;i<=n;i++)q[i]=p[i];

    sort(p+,p++n,cmp);

    for(int i=;i<=n;i++){

        sumx[i]=sumx[i-]+p[i].x;

        sumy[i]=sumy[i-]+p[i].y;

    }

    for(int i=;i<=n;i++){

        ans[p[i].id]+=(i-)*p[i].y;

        ans[p[i].id]+=sumx[i-];

        ans[p[i].id]+=(n-i)*p[i].x;

        ans[p[i].id]+=sumy[n]-sumy[i];

    }

    while(m--){

        int u,v;

        scanf("%d%d",&u,&v);

        Node a=q[u],b=q[v];

        ll sum=min(a.x+b.y,a.y+b.x);

        ans[u]-=sum;

        ans[v]-=sum;

    }

    for(int i=;i<=n;i++)

        cout<<ans[i]<<" ";

}