#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<int, int> pii;

const int maxn = 20050;

int n, m, ans[maxn];
pii b[maxn];
bool vis[maxn], mk[maxn];
vector<int> G[maxn];

struct node {
	int x, y, i;
} a[maxn];

void dfs(int u, int x, int y) {
	mk[u] = 1;
	for (int v : G[u]) {
		if (vis[v] && !mk[v] && (ans[v] == x || ans[v] == y)) {
			dfs(v, x, y);
		}
	}
}

void solve() {
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; ++i) {
		scanf("%d%d", &a[i].x, &a[i].y);
		a[i].i = i;
		b[i] = mkp(a[i].x, a[i].y);
	}
	sort(a + 1, a + n + 1, [&](const node &a, const node &b) {
		return a.x > b.x || (a.x == b.x && a.y > b.y);
	});
	while (m--) {
		int u, v;
		scanf("%d%d", &u, &v);
		G[u].pb(v);
		G[v].pb(u);
	}
	for (int i = 1; i <= n; ++i) {
		int u = a[i].i, S = 0;
		vis[u] = 1;
		for (int v : G[u]) {
			if (vis[v]) {
				S |= (1 << ans[v]);
			}
		}
		if (S != 30) {
			ans[u] = 1;
			while (S & (1 << ans[u])) {
				++ans[u];
			}
			continue;
		}
		int v1 = -1, v2 = -1, v3 = -1, v4 = -1;
		for (int v : G[u]) {
			if (vis[v]) {
				if (b[v].fst == a[i].x) {
					v1 = v;
				} else if (b[v].fst - a[i].x == b[v].scd - a[i].y) {
					v2 = v;
				} else if (b[v].scd == a[i].y) {
					v3 = v;
				} else {
					v4 = v;
				}
			}
		}
		int x = ans[v1], y = ans[v3];
		mems(mk, 0);
		dfs(v1, x, y);
		if (mk[v3]) {
			mems(mk, 0);
			x = ans[v2];
			y = ans[v4];
			dfs(v2, x, y);
		}
		for (int j = 1; j <= n; ++j) {
			if (mk[j]) {
				ans[j] ^= x ^ y;
			}
		}
		ans[u] = x;
	}
	for (int i = 1; i <= n; ++i) {
		printf("%d\n", ans[i]);
	}
}

int main() {
	int T = 1;
	// scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}