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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Set;
import java.util.StringTokenizer;
import java.util.stream.Collectors;


public class D{
	
	static class FastReader 
    { 
        BufferedReader br; 
        StringTokenizer st; 
  
        public FastReader() 
        { 
            br = new BufferedReader(new
                     InputStreamReader(System.in)); 
        } 
  
        String next() 
        { 
            while (st == null || !st.hasMoreElements()) 
            { 
                try
                { 
                    st = new StringTokenizer(br.readLine()); 
                } 
                catch (IOException  e) 
                { 
                    e.printStackTrace(); 
                } 
            } 
            return st.nextToken(); 
        } 
  
        int nextInt() 
        { 
            return Integer.parseInt(next()); 
        } 
  
        long nextLong() 
        { 
            return Long.parseLong(next()); 
        } 
  
        double nextDouble() 
        { 
            return Double.parseDouble(next()); 
        } 
  
        String nextLine() 
        { 
            String str = ""; 
            try
            { 
                str = br.readLine(); 
            } 
            catch (IOException e) 
            { 
                e.printStackTrace(); 
            } 
            return str; 
        } 
    }
	static int l,r;
	static long sum = 0L;
	static void maxSum(long a[])
	{
		long max_so_far = Long.MIN_VALUE, 
		        max_ending_here = 0;
		int start = 0, end = 0, s = 0; 
		int size = a.length; 
		        for (int i = 0; i < size; i++)  
		        { 
		            max_ending_here += a[i]; 
		  
		            if (max_so_far < max_ending_here)  
		            { 
		                max_so_far = max_ending_here; 
		                start = s; 
		                end = i; 
		            } 
		  
		            if (max_ending_here < 0)  
		            { 
		                max_ending_here = 0; 
		                s = i + 1; 
		            } 
		        }
		        if(max_so_far > 0)
		        {
		        	l = start;
		        	r = end;
		        }
		        else
		        {
		        	l = -1;
		        	r = -1;
		        }
		        sum = max_so_far;
	}
	
	static class Pair
	{
		int a;
		int b;
		Pair(int a,int b)
		{
			this.a = a;
			this.b = b;
		}
	}
	
	static long mod;
	static long fact(long n)
	{	
		long f = 1L;
		
		for(long i = 2; i <= n; i++)
		{
			f = (f*i)%mod;
		}
		return f;
	}
	public static void main(String[] args) 
	{
		OutputStream outputStream = System.out;
        FastReader sc = new FastReader();
        PrintWriter out = new PrintWriter(outputStream);
        
        int n = sc.nextInt();
        int m = sc.nextInt();
        
        ArrayList<Integer> ar[] = new ArrayList[n+1];
        
        for(int i = 1; i <= n; i++)
        {
        	ar[i] = new ArrayList<>();
        }
        
        for(int i = 1;i <= m; i++)
        {
        	int x = sc.nextInt();
        	int y = sc.nextInt();
        	ar[x].add(y);
        	ar[y].add(x);
        }
        
        HashSet<Integer> f = new HashSet<>();
        HashSet<Integer> s = new HashSet<>();
        HashSet<Integer> t = new HashSet<>();
        for(int i:ar[1])
        {
        	s.add(i);
        }
        
        for(int i = 1;i <= n; i++)
        {
        	if(!s.contains(i))
        	{
        		f.add(i);
        	}
        }
        
        ArrayList<Integer> rem = new ArrayList<>();
        for(int i:s)
        {
        	rem.add(i);
        }
        int map[] = new int[n+1];
        for(int i:rem)
        {	
        	if(map[i] == -1) continue;
        	for(int j:ar[i])
        	{
        		if(s.contains(j))
        		{
        			s.remove(j);
        			map[j] = -1;
        			t.add(j);
        		}
        	}
        }
        for(int i:f)
        {
        	for(int j:ar[i])
        	{
        		if(f.contains(j))
        		{
        			out.println(-1);
        			out.close();
        			return;
        		}
        	}
        }
        for(int i:t)
        {
        	for(int j:ar[i])
        	{
        		if(t.contains(j))
        		{
        			out.println(-1);
        			out.close();
        			return;
        		}
        	}
        }
        
        int ans = f.size()*s.size()+s.size()*t.size()+f.size()*t.size();
        
        if(ans != m || f.size() == 0 || s.size() == 0 || t.size() == 0)
        {
        	out.println(-1);
        	out.close();
        	return;
        }
        
        int fans[] = new int[n+1];
        for(int i:f)
        {
        	fans[i] = 1;
        }
        for(int i:s)
        {
        	fans[i] = 2;
        }
        for(int i:t)
        {
        	fans[i] = 3;
        }
        
        for(int i = 1; i <= n; i++)
        {
        	out.print(fans[i]+" ");
        }
        out.close();
	}

}
