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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Map;
import java.util.Queue;
import java.util.StringTokenizer;
 
 
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
 
/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) throws IOException {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader sc = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Task solver = new Task();
        solver.solve(1, sc, out);
        out.close();
    }
 
    static class Task {

        public void solve(int testNumber, InputReader sc, PrintWriter out) throws IOException {
        	int n=sc.nextInt();
        	int m=sc.nextInt();
        	HashSet<Integer>[] edge=new HashSet[n+1];
            for(int i=0;i<=n;i++)
            	edge[i]=new HashSet<Integer>();
        	
        	 for(int i=0;i<m;i++) {
             	int x=sc.nextInt();
             	int y=sc.nextInt();
             	edge[x].add(y);
             	edge[y].add(x);
             }
             HashSet<Integer>[] set=new HashSet[3];
             for(int i=0;i<3;i++)
            	 set[i]=new HashSet<Integer>();
            int[] color=new int[n+1];
            Arrays.fill(color, -2);
            color[1]=1;
            set[1].add(1);
            for(int v:edge[1])
            	color[v]=-1;
            for(int i=1;i<=n;i++) {
            	if(color[i]==-1) {
            		color[i]=0;
            		for(int v:edge[i])
            			if(color[v]==-1)
            				color[v]=2;
            		for(int j=1;j<=n;j++) {
            			if(color[i]==-1)
            				color[i]=0;
            		}
            	}
            }
            for(int i=1;i<=n;i++) {
            	if(color[i]==-2)
            		color[i]=1;
            }
            for(int i=1;i<=n;i++) {
            	if(color[i]>=0&&color[i]<=2) {
            		set[color[i]].add(i);
            	}
            }
            for(int i=1;i<=n;i++) {
            	for(int v:edge[i]) {
            		if(color[i]==color[v]) {
            			out.println("-1");
            			return ;
            		}
            	}
            }
            for(int i=0;i<3;i++) {
            	if(set[i].size()==0) {
            		out.println("-1");
        			return ;
            	}
            }

            if(1l*set[0].size()*set[1].size()+1l*set[0].size()*set[2].size()+1l*set[1].size()*set[2].size()!=m) {
            	 out.println("-1");
            	 return ;
             }
             for(int i=1;i<=n;i++) {
            	 if(set[0].contains(i))
            		 out.print("1 ");
            	 else
            		 if(set[1].contains(i))
            			 out.print("2 ");
            	 else
            		 if(set[2].contains(i))
            	    	 out.print("3 ");
             }
             out.println();
             
        }
    }
 
    static class InputReader{
        StreamTokenizer tokenizer;
        public InputReader(InputStream stream){
            tokenizer=new StreamTokenizer(new BufferedReader(new InputStreamReader(stream)));
            tokenizer.ordinaryChars(33,126);
            tokenizer.wordChars(33,126);
        }
        public String next() throws IOException {
            tokenizer.nextToken();
            return tokenizer.sval;
        }
        public int nextInt() throws IOException {
            return Integer.parseInt(next());
        }
        public long nextLong() throws IOException {
            return Long.parseLong(next());
        }
        public boolean hasNext() throws IOException {
            int res=tokenizer.nextToken();
            tokenizer.pushBack();
            return res!=tokenizer.TT_EOF;
        }
        
        public double nextDouble() throws NumberFormatException, IOException {
        	return Double.parseDouble(next());
        }
        
        public BigInteger nextBigInteger() throws IOException {
        	return new BigInteger(next());
        }
    }
}
