#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

#define ll long long
#define endl '\n'
using namespace std;
using namespace __gnu_pbds;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 2e5+7, P1 = 31, P2 = 37, mod= 1e9 + 7;
#define ld long double
#define pi acos(-1)
const ld eps = 1e-9;
using pType = long double;
struct point{
    pType X, Y;
    ld angle;

    point(){
        X = Y = angle = 0;
    };

    point(pType x, pType y){
        X = x, Y = y;

        if(Y == 0)
            angle = (X < 0 ? pi : 0);
        else if(X == 0)
            angle = (Y < 0 ? 3 * pi / 2 : pi / 2);

        angle = atan2(Y, X);
        if(X > 0 and Y > 0)
            ;
        else if(X < 0 and Y > 0)
            angle = pi - angle;
        else if(X < 0 and Y < 0)
            angle = pi + angle;
        else
            angle = 2 * pi - angle;
    }

    const point operator*(const ld &factor) const{
        return point(X * factor, Y * factor);
    }
    const point operator/(const ld &factor) const {
        assert(fabs(factor) > eps);
        return point(X / factor, Y / factor);
    }

    const point operator-(const point &other) const {
        return point(X - other.X, Y - other.Y);
    }

    const point operator+(const point &other) const {
        return point(X + other.X, Y + other.Y);
    }


};
void doWork() {
    int fix[105];
    vector<int> adj[105];
    int n,m;
    cin >> n >> m;
    vector<point> p;
    for(int i = 0;i < n;++i)
    {
        ld a,b;
        cin >> a >> b;
        p.emplace_back(a,b);
        if(a != -1 && b != -1)
            fix[i] = 1;
        else
            fix[i] =0;
    }
    for(int i = 0;i < m;++i)
    {
        int u,v;
        cin >> u >> v;
        --u,--v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    vector<point> cur(n);
    for(int i = 0;i < 1e5;++i)
    {
        for(int j = 0;j < n;++j)
        {
            if(fix[j])
                cur[j] = p[j];
            else
            {
                point ex(0.0,0.0);
                for(auto &v : adj[j])
                {
                    ex = ex + p[v];
                }
                cur[j] = (p[j] + ex / (1.0*adj[j].size()))/2;
            }
        }
        for(int j = 0;j < n;++j)
            p[j] = cur[j];
    }

    for(auto i : p)
        cout << fixed << setprecision(10) << i.X << " " << i.Y << endl;
}


int main() {
    ios::sync_with_stdio(false);
    cout.tie(nullptr);
    cin.tie(nullptr);
//    freopen("bisector.in","r",stdin);
//    freopen("bisector.out","w",stdout);
    int t = 1;
    // cout << primes.size() << endl;
    // cin >> t;
    while (t--) {
        doWork();
    }
    return 0;
}