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.*;
import java.io.*;
public class Main
{
    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; 
        } 
    }
    public static void main(String args[])
    {
        FastReader fs=new FastReader();
        PrintWriter pw=new PrintWriter(System.out);
        int n=fs.nextInt();
        int m=fs.nextInt();
        HashSet<String> hs=new HashSet<>();
        ArrayList<Integer> edge[]=new ArrayList[n+1];
        for(int i=0;i<=n;i++)
        edge[i]=new ArrayList<>();
        for(int i=0;i<m;i++)
        {
            int u=fs.nextInt();
            int v=fs.nextInt();
            edge[u].add(v);
            edge[v].add(u);
            hs.add(u+" "+v);
            hs.add(v+" "+u);
        }
        if(m<2*n-3||(n>3&&m>=(1L*n*(n-1))/2))
        pw.println(-1);
        else
        {
            HashSet<Integer> v[]=new HashSet[3];
            for(int i=0;i<3;i++)
            v[i]=new HashSet<>();
            TreeSet<Integer> ts=new TreeSet<>();
            for(int i=1;i<=n;i++)
            ts.add(i);
            for(int i:edge[1])
            ts.remove(i);
            for(int i:ts)
            v[0].add(i);
            ts.clear();
            for(int i=1;i<=n;i++)
            {
                if(!v[0].contains(i))
                ts.add(i);
            }
            int f=ts.pollFirst();
            for(int i:edge[f])
            ts.remove(i);
            ts.add(f);
            for(int i:ts)
            v[1].add(i);
            for(int i=1;i<=n;i++)
            {
                if(!v[0].contains(i)&&!v[1].contains(i))
                v[2].add(i);
            }
            if(v[0].isEmpty()||v[1].isEmpty()||v[2].isEmpty())
            {
                System.out.println(-1);
                return;
            }
            for(String s:hs)
            {
                int x=Integer.parseInt(s.split(" ")[0]);
                int y=Integer.parseInt(s.split(" ")[1]);
                for(int i=0;i<3;i++)
                {
                    if(v[i].contains(x)&&v[i].contains(y))
                    {
                        System.out.println(-1);
                        return;
                    }
                }
            }
            for(int i=0;i<3;i++)
            {
                for(int j=i+1;j<3;j++)
                {
                    for(int k:v[i])
                    {
                        for(int p:v[j])
                        {
                            if(!hs.contains(k+" "+p)&&!hs.contains(p+" "+k))
                            {
                                System.out.println(-1);
                                return;
                            }
                        }
                    }
                }
            }
            int col[]=new int[n+1];
            for(int i=0;i<3;i++)
            {
                for(int j:v[i])
                col[j]=i+1;
            }
            for(int i=1;i<=n;i++)
            pw.print(col[i]+" ");
        }
        pw.flush();
        pw.close();
    }
}