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.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.StringTokenizer;

public class Round589Div2D {

	public static HashSet<Integer>[] adj;
	
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		out=new PrintWriter (new BufferedOutputStream(System.out));
		FastReader s=new FastReader();
		int n=s.nextInt();
		int m=s.nextInt();
		adj=new HashSet[n];
		for(int i=0;i<n;i++) {
			adj[i]=new HashSet<Integer>();
		}
		for(int i=0;i<m;i++) {
			int u=s.nextInt()-1;
			int v=s.nextInt()-1;
			adj[u].add(v);
			adj[v].add(u);
		}
		ArrayList<Integer> set1=new ArrayList<Integer>();
		set1.add(0);
		for(int i=1;i<n;i++) {
			if(!adj[0].contains(i)) {
				set1.add(i);
			}
		}
		int[] visited=new int[n];
		visited[0]=1;
		for(int i=0;i<set1.size();i++) {
			for(Integer x:adj[set1.get(i)]) {
				if(adj[0].contains(x)) {
				}else {
					out.println(-1);
					out.close();
					return;
				}
			}
			if(adj[0].size()!=adj[set1.get(i)].size()) {
				out.println(-1);
				out.close();
				return ;
			}else {
				visited[set1.get(i)]=1;
			}
		}
		int curr=-1;
		for(int i=0;i<n;i++) {
			if(visited[i]!=1) {
				curr=i;
				break;
			}
		}
		if(curr==-1) {
			out.println(-1);
			out.close();
			return ;
		}
		ArrayList<Integer> set2=new ArrayList<Integer>();
		visited[curr]=2;
		set2.add(curr);
		for(int i=0;i<n;i++) {
			if(i!=curr && !adj[curr].contains(i)) {
				set2.add(i);
			}
		}
		for(int i=0;i<set2.size();i++) {
			for(Integer x:adj[set2.get(i)]) {
				if(adj[curr].contains(x)) {
				}else {
					out.println(-1);
					out.close();
					return;
				}
			}
			if(adj[curr].size()!=adj[set2.get(i)].size()) {
				out.println(-1);
				out.close();
				return ;
			}else {
				visited[set2.get(i)]=2;
			}
		}
		HashSet<Integer> set3=new HashSet<>();
		for(int i=0;i<n;i++) {
			if(visited[i]==0) {
				set3.add(i);
				visited[i]=3;
			}
		}
		if(set3.size()==0) {
			out.println(-1);
			out.close();
			return ;
		}
		for(Integer x:set3) {
			for(Integer y:adj[x]) {
				if(set3.contains(y)) {
					out.println(-1);
					out.close();
					return;
				}
			}
		}
		for(int i=0;i<n;i++) {
			if(i>0)out.print(" ");
			out.print(visited[i]);
		}
		
		out.close();
	}

	public static PrintWriter out;
	
	public static class FastReader {
		BufferedReader br;
		StringTokenizer st;
		//it reads the data about the specified point and divide the data about it ,it is quite fast
		//than using direct 

		public FastReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
			//InputStream reads the data and decodes in character stream
			//It acts as bridge between byte stream and character stream
		}

		String next() {
			while (st == null || !st.hasMoreTokens()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (Exception e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}

		int nextInt() {
			return Integer.parseInt(next());//converts string to integer
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (Exception e) {
				e.printStackTrace();
			}
			return str;
		}
	}
	
}
