You have a simple undirected graph consisting of n vertices and m edges. The graph doesn't contain self-loops, there is at most one edge between a pair of vertices. The given graph can be disconnected.

Let's make a definition.

Let v_1 and v_2 be two some nonempty subsets of vertices that do not intersect. Let f(v_{1}, v_{2}) be true if and only if all the conditions are satisfied:

  1. There are no edges with both endpoints in vertex set v_1. 
  2. There are no edges with both endpoints in vertex set v_2. 
  3. For every two vertices x and y such that x is in v_1 and y is in v_2, there is an edge between x and y. 



Create three vertex sets (v_{1}, v_{2}, v_{3}) which satisfy the conditions below;

  1. All vertex sets should not be empty. 
  2. Each vertex should be assigned to only one vertex set. 
  3. f(v_{1}, v_{2}), f(v_{2}, v_{3}), f(v_{3}, v_{1}) are all true. 



Is it possible to create such three vertex sets? If it's possible, print matching vertex set for each vertex.

Input

The first line contains two integers n and m (3 ≤ n ≤ 10^{5}, 0 ≤ m ≤ min(3 ⋅ 10^{5}, (n(n-1))/(2))) — the number of vertices and edges in the graph.

The i-th of the next m lines contains two integers a_{i} and b_{i} (1 ≤ a_{i} < b_{i} ≤ n) — it means there is an edge between a_{i} and b_{i}. The graph doesn't contain self-loops, there is at most one edge between a pair of vertices. The given graph can be disconnected.

Output

If the answer exists, print n integers. i-th integer means the vertex set number (from 1 to 3) of i-th vertex. Otherwise, print -1.

If there are multiple answers, print any.

Examples

Input


6 11
1 2
1 3
1 4
1 5
1 6
2 4
2 5
2 6
3 4
3 5
3 6


Output


1 2 2 3 3 3 

Input


4 6
1 2
1 3
1 4
2 3
2 4
3 4


Output


-1

Note

In the first example, if v_{1} = \{ 1 \}, v_{2} = \{ 2, 3 \}, and v_{3} = \{ 4, 5, 6 \} then vertex sets will satisfy all conditions. But you can assign vertices to vertex sets in a different way; Other answers like "2 3 3 1 1 1" will be accepted as well.

<image>

In the second example, it's impossible to make such vertex sets.

import java.util.*;

public class Main {
    public static void main(String args[]) {
        Scanner s=new Scanner(System.in);
		int n=s.nextInt();
		int m=s.nextInt();
		HashSet<Integer> g[]=new HashSet[n+1];
		pair arr[]=new pair[m];
		for(int i=0;i<g.length;i++) {
			g[i]=new HashSet<Integer>();
			}
		for(int i=0;i<m;i++) {
			int a=s.nextInt();
			int b=s.nextInt();
			pair p=new pair(a,b);
			arr[i]=p;
			g[a].add(b);
			g[b].add(a);
		}
		HashSet<Integer> f1=new HashSet<Integer>();
		HashSet<Integer> f2=new HashSet<Integer>();
		HashSet<Integer> f3=new HashSet<Integer>();
		for(int i=1;i<=n;i++) {
			if(!g[1].contains(i)) {
			f1.add(i);
			}
		}
		
		for(int i=1;i<=n;i++) {
			if(!f1.contains(i)) {
				for(int j=1;j<=n;j++) {
					if(!g[i].contains(j)) {
					f2.add(j);
					}
				}
				
				break;
			}
		}
		for(int i=1;i<=n;i++) {
			if(!f1.contains(i)&&(!f2.contains(i))) {
				for(int j=1;j<=n;j++) {
					if(!g[i].contains(j)) {
					f3.add(j);
					}
				}
				break;
			}
		}
//		System.out.println(f1);
//		System.out.println(f2);
//		System.out.println(f3);
		if(f1.size()==0||f2.size()==0||f3.size()==0) {
			System.out.print(-1);
			return;
		}
		if(f1.size()+f2.size()+f3.size()!=n) {
			System.out.print(-1);
			return;
		}
		if(f1.size()*f2.size()+f2.size()*f3.size()+f3.size()*f1.size()!=m) {
			System.out.print(-1);
			return;
		}
		for(int i=0;i<m;i++) {
			int a=arr[i].a;
			int b=arr[i].b;
			if(f1.contains(a)) {
				if((!f2.contains(b)&&(!f3.contains(b)))||(f1.contains(b))) {
					System.out.print(-1);
					return;
				}
			}
			else if(f2.contains(a)) {
				if((!f1.contains(b)&&(!f3.contains(b)))||(f2.contains(b))) {
					System.out.print(-1);
					return;
				}
			}
			else if(f3.contains(a)) {
				if((!f1.contains(b)&&(!f2.contains(b)))||(f3.contains(b))) {
					System.out.print(-1);
					return;
				}
			}

		}
		for(int i=1;i<=n;i++) {
			if(f1.contains(i)) {
				System.out.print(1+" ");
			}
			else if (f2.contains(i)) {
				System.out.print(2+" ");
			}
			else  {
				System.out.print(3+" ");
			}
		}
    }
}
class pair{
	public int a;
	public int b;
	public pair(int a,int b){
		this.a=a;
		this.b=b;
	}
	
}