#include<bits/stdc++.h>
using namespace std;

const int N=10010;
int n,ans[N],col[N],m,x,y,p[5],q[N],l,r,ccc;
pair<int,int> a[N],b[N];
map<pair<int,int>,int> M1,M2;
vector<int> v[N],V[N];
bool bo[5],inq[N];

bool bfs(int lim,int s,int t,int c1,int c2)
{
	q[l=r=1]=s,inq[s]=1;
	while (l<=r)
	{
		x=q[l++];
		for (int i=0,sz=V[x].size(); i<sz; i++)
			if (V[x][i]>=lim&&!inq[V[x][i]]&&col[V[x][i]]==c1+c2-col[x]) inq[q[++r]=V[x][i]]=1;
	}
	if (inq[t])
	{
		for (int i=1; i<=r; i++) inq[q[i]]=0;
		return 0;
	}
	col[lim-1]=col[s];
	for (int i=1; i<=r; i++) inq[q[i]]=0,col[q[i]]=c1+c2-col[q[i]];
	return 1;
}

int main()
{
//	freopen("construct.in","r",stdin);freopen("construct.out","w",stdout);
	memset(inq,0,sizeof(inq));
	scanf("%d%d",&n,&m),M1.clear(),M2.clear();
	for (int i=1; i<=n; i++) scanf("%d%d",&a[i].first,&a[i].second),M1[a[i]]=i,b[i]=a[i],v[i].clear(),V[i].clear();
	sort(a+1,a+1+n);
	for (int i=1; i<=n; i++) M2[a[i]]=i;
	while (m--)
	{
		scanf("%d%d",&x,&y),x=M2[b[x]],y=M2[b[y]];
		V[x].push_back(y),V[y].push_back(x);
		if (x<y) swap(x,y);
		v[y].push_back(x);
	}
	for (int i=n; i; i--)
	{
		memset(bo,0,sizeof(bo)),col[i]=-1;
		for (int j=0,sz=v[i].size(); j<sz; j++) bo[col[v[i][j]]]=1;
		for (int j=0; j<4; j++) if (!bo[j]) {col[i]=j; break;}
		if (col[i]!=-1) continue;
		for (int j=0; j<4; j++)
			if (a[v[i][j]].first==a[i].first) p[0]=v[i][j]; else
			if (a[v[i][j]].second==a[i].second) p[2]=v[i][j]; else
			if (a[v[i][j]].second>a[i].second) p[1]=v[i][j]; else p[3]=v[i][j];
		if (!bfs(i+1,p[0],p[2],col[p[0]],col[p[2]])) bfs(i+1,p[1],p[3],col[p[1]],col[p[3]]);
	}
	for (int i=1; i<=n; i++) ans[M1[a[i]]]=col[i];
	for (int i=1; i<=n; i++) printf("%d\n",ans[i]+1);
	return 0;
}