//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 200005
#define inf 0x3f3f3f3f

int n,m;
int p[maxn],rnk[maxn],x[maxn],y[maxn],col[maxn],X[maxn],Y[maxn];
vi e[maxn];
bool vis[maxn];
int o[5];

int q[maxn],tl=1,tr=0;
bool inq[maxn];
bool work(int s,int t){
	q[tl=tr=1]=s,inq[s]=1;
	int cs=col[s],ct=col[t];
	while(tl<=tr){
		int u=q[tl++];
		for(int v:e[u]){
			if(col[v] && col[v]==cs+ct-col[u] && !inq[v])
				inq[v]=1,q[++tr]=v;
		}
	}
	if(inq[t]){
		For(i,1,tr)inq[q[i]]=0;
		return 0;
	}
	For(i,1,tr)inq[q[i]]=0,col[q[i]]=cs+ct-col[q[i]];
	return 1;
}

signed main()
{
	n=read(),m=read();
	For(i,1,n)x[i]=read(),y[i]=read(),p[i]=i;
	sort(p+1,p+n+1,[&](int i,int j){
		return x[i]<x[j]||(x[i]==x[j]&&y[i]<y[j]);
	});
	For(i,1,n)rnk[p[i]]=i,X[i]=x[p[i]],Y[i]=y[p[i]];
	For(i,1,n)x[i]=X[i],y[i]=Y[i];
	For(i,1,m){
		int u=read(),v=read();
		u=rnk[u],v=rnk[v];
		e[u].pb(v),e[v].pb(u);
	}
	For(u,1,n){
		For(i,1,4)vis[i]=0;
		for(int v:e[u])if(col[v])vis[col[v]]=1;
		For(i,1,4)if(!vis[i]){col[u]=i;break;}
		if(col[u])continue;
		for(int v:e[u])if(col[v]){
			if(x[u]==x[v] && y[v]<y[u]) o[0]=v;
			if(x[v]<x[u] && y[v]<y[u]) o[1]=v;
			if(x[v]<x[u] && y[v]==y[u]) o[2]=v;
			if(x[v]<x[u] && y[v]>y[u]) o[3]=v;
		}
		assert(work(o[0],o[2])||work(o[1],o[3]));
		For(i,1,4)vis[i]=0;
		for(int v:e[u])if(col[v])vis[col[v]]=1;
		For(i,1,4)if(!vis[i]){col[u]=i;break;}
		assert(col[u]);
	}
	For(i,1,n)cout<<col[rnk[i]]<<"\n";
	return 0;
}