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

#define el '\n'
#define FIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef complex<ld> pt;
typedef unsigned long long ull;

template<typename T, typename X>
using hashTable = gp_hash_table<T, X>;
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

// mt19937_64 for long long
mt19937 rng(std::chrono::system_clock::now().time_since_epoch().count());

const int N = 1e2 + 5;

vector<int> G[N];

void pulse(vector<pair<pair<ld, ld>, bool>> &pos, int n)
{
    for(int i = 1; i <= n; i++)
    {
        if(pos[i].second == 0)
            continue;

        ld sz = G[i].size();
        bool canCalc = true;
        ld sumX = 0, sumY = 0;
        for(auto &neig: G[i])
        {
            sumX += pos[neig].first.first;
            sumY += pos[neig].first.second;
        }
        pair<ld, ld> tmp = {sumX / sz, sumY / sz};
        pos[i].first = {(tmp.first + pos[i].first.first) / 2, (tmp.second + pos[i].first.second) / 2};
    }
}

void doWork()
{
    int n, m;
    cin >> n >> m;
    vector<pair<pair<ld, ld>, bool>> pos(n + 1);
    for(int i = 1, x, y; i <= n; i++)
    {
        cin >> x >> y, pos[i].first = {x, y};
        if(x == -1)
            pos[i].first = {0, 0}, pos[i].second = 1;
    }

    for(int i = 0, u, v; i < m; i++)
        cin >> u >> v, G[u].push_back(v), G[v].push_back(u);

    for(int t = 0; t < 1e5; t++)
        pulse(pos, n);


    for(int i = 1; i <= n; i++)
        cout << fixed << setprecision(6) << pos[i].first.first << ' ' << pos[i].first.second << '\n';

}

int main()
{
    int T = 1;
//    cin >> T
    while(T--)
        doWork();
}