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.
//////////package random_practiceQuestions;


import java.io.*;
import java.util.*;

public class D1228 {
    static class InputReader {
        BufferedReader reader;
        StringTokenizer tokenizer;
        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 1000000);
            tokenizer = null; }
        //////////////////////////////////////////////////////////////////////////////////////////
        String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken(); }
        ///////////////////////////////////////////////////////////////////////////////////////////
        public int nextInt() { return Integer.parseInt(next()); }
        public long nextLong() { return Long.parseLong(next()); }
        public double nextDouble() { return Double.parseDouble(next()); }
    }
    static InputReader r = new InputReader(System.in);
    static PrintWriter pw = new PrintWriter(System.out);
    public static void main(String[] args){
        int n=r.nextInt();
        int m=r.nextInt();
        boolean[] visit=new boolean[n];
        ArrayList<Integer>[] arr=new ArrayList[n];

        for (int i=0;i<n;i++){
            arr[i]=new ArrayList<>();
        }
        for (int i=0;i<m;i++){
            int a=r.nextInt()-1; int b=r.nextInt()-1;
            arr[a].add(b);arr[b].add(a);
        }
        int[] ans=new int[n];
        for (int i:arr[0]){
            visit[i]=true;
        }
        for (int i=0;i<visit.length;i++){
            if (!visit[i]){
                ans[i]=2;
            }
        }
        Arrays.fill(visit,false);
        int ind=0;
        for (int i=0;i<ans.length;i++){
            if (ans[i]!=2){
                ind=i;break;
            }
        }
        for (int i:arr[ind]){
            if (ind==0){
                break;
            }
            if (ans[i]==0){
                ans[i]=1;
            }
        }
        int count1=0;int count2=0; int count3=0;
        for (int i:ans){
            if (i==1){
                count1++;
            }
            else if (i==2){
                count2++;
            }
            else{
                count3++;
            }
        }
        int[] count=new int[3];
        count[0]=count3;count[1]=count1;count[2]=count2;


        boolean check=true;
        for (int i=0;i<arr.length;i++){
            int c=0;
            for (int j:arr[i]){
                if (ans[j]==ans[i]){
                    check=false;
                    break;
                }
                c++;
            }
            if (!check){
                break;
            }
            if (n-count[ans[i]]!=c){
                check=false;
                break;
            }
        }
       /* for (int i:ans){
            System.out.print(i+" ");
        }
        System.out.println();

        for (int i:count){
            System.out.print(i+" ");
        }
        System.out.println();*/
        if (check && count1!=0 && count2!=0 && count3!=0){
            for (int i:ans){
                pw.print((1+i)+" ");
            }
        }
        else{
            pw.println(-1);
        }
        pw.close();
    }
}
