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

#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define ld long double
#define el "\n"
#define matrix vector<vector<int>>
#define pt complex<ld>
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ordered_multiset tree<ll, null_type,less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update>
using namespace __gnu_pbds;
using namespace std;
const ll N = 100 + 5, LOG = 20, INF = 1e18;
const ld pi = acos(-1);
const int mod = 1e9 + 7;
const ld eps = 1e-10;
int dx[] = {0, 1, 0, -1, -1, 1, -1, 1};
int dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
ll n, m, x, y, k;
pair<ld, ld> ans[N], tmp[N];
vector<int> adj[N];
bool done[N];

void dowork() {
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        cin >> x >> y;
        done[i] = 1;
        if (x == -1 && y == -1) {
            done[i] = 0;
            continue;
        }
        ans[i] = {x, y};
    }
    for (int i = 0; i < m; i++) {
        cin >> x >> y;
        adj[x].push_back(y);
        adj[y].push_back(x);
    }
    pair<ld, ld> cur;
    bool finish = 0;
    while (finish == 0) {
        finish = 1;
        for (int i = 1; i <= n; i++) {
            tmp[i] = ans[i];
            if (done[i]) {
                continue;
            }
            cur = {0, 0};
            for (auto j : adj[i]) {
                cur.first += ans[j].first;
                cur.second += ans[j].second;
            }
            tmp[i] = ans[i];
            tmp[i].first += (cur.first / adj[i].size());
            tmp[i].second += (cur.second / adj[i].size());
            tmp[i].first /= 2.0;
            tmp[i].second /= 2.0;
        }
        for (int i = 1; i <= n; i++) {
            if (done[i]) {
                continue;
            }
            if ((abs(ans[i].first - tmp[i].first)) > 1e-5 || (abs(ans[i].first - tmp[i].first)) > 1e-5) {
                finish = 0;
            }
            ans[i] = tmp[i];
        }
    }
    for (int i = 1; i <= n; i++) {
        cout << fixed << setprecision(3) << ans[i].first << " " << ans[i].second << el;
    }
}

signed main() {
    fast
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    int t = 1;
    //cin >> t;
    for (int i = 1; i <= t; i++) {
        dowork();
    }
    return 0;
}