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.*;
import java.util.*;

public class D
{
    PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
    BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer tok;

    public void go() throws IOException
    {
        ntok();
        int n = ipar();
        int m = ipar();
        Vertex[] vertices = new Vertex[n];
        for (int i = 0; i < n; i++)
        {
            vertices[i] = new Vertex(i);
        }
        for (int i = 0; i < m; i++)
        {
            ntok();
            int a = ipar() - 1;
            int b = ipar() - 1;
            vertices[a].add(vertices[b]);
        }
        int c = 1;
        boolean works = true;
        ArrayList<Integer> counts = new ArrayList<>();
        for (Vertex curr : vertices)
        {
            // out.println(Arrays.toString(vertices));
            if (curr.comp == 0)
            {
                int co = 1;
                curr.comp = c;
                for (Vertex v : vertices)
                {
                    if (v == curr)
                    {
                        continue;
                    }
                    if (!curr.others.contains(v))
                    {
                        if (v.comp != 0)
                        {
                            works = false;
                            break;
                        }
                        v.comp = c;
                        co++;
                    }
                    else if (v.comp == c)
                    {
                        works = false;
                        break;
                    }
                }
                c++;
                counts.add(co);
            }
            else
            {
                for (Vertex v : curr.others)
                {
                    if (v.comp == curr.comp)
                    {
                        // out.println(v.i + " !!! " + curr.i);
                        works = false;
                        break;
                    }
                }
            }
        }
        for (Vertex curr : vertices)
        {
            if (curr.comp < 1 || curr.comp > 3)
            {
                works = false;
                break;
            }
            for (Vertex other : curr.others)
            {
                if (curr.comp == other.comp)
                {
                    works = false;
                    break;
                }
            }
        }

        long sum = 0;
        for (int i = 0; i < counts.size(); i++)
        {
            for (int e = i+1; e < counts.size(); e++)
            {
                sum += counts.get(i) * counts.get(e);
            }
        }
        if (sum != m)
        {
            works = false;
        }

        // out.println(Arrays.toString(vertices));
        if (c == 4 && works)
        {
            for (int i = 0; i < n; i++)
            {
                if (i != 0)
                {
                    out.print(" ");
                }
                out.print(vertices[i].comp);
            }
            out.println();
        }
        else
        {
            out.println(-1);
            // out.println("FFSDFS");
        }

        out.flush();
        in.close();
    }

    private class Vertex
    {
        HashSet<Vertex> others;
        int i;
        int comp;

        public Vertex(int i)
        {
            others = new HashSet<>();
            this.i = i;
        }

        public void add(Vertex other)
        {
            others.add(other);
            other.others.add(this);
        }

        public String toString()
        {
            return String.format("%d=%d", i, comp);
        }
    }

    public void ntok() throws IOException
    {
        tok = new StringTokenizer(in.readLine());
    }

    public int ipar()
    {
        return Integer.parseInt(tok.nextToken());
    }

    public int[] iapar(int n)
    {
        int[] arr = new int[n];
        for (int i = 0; i < n; i++)
        {
            arr[i] = ipar();
        }
        return arr;
    }

    public long lpar()
    {
        return Long.parseLong(tok.nextToken());
    }

    public long[] lapar(int n)
    {
        long[] arr = new long[n];
        for (int i = 0; i < n; i++)
        {
            arr[i] = lpar();
        }
        return arr;
    }

    public double dpar()
    {
        return Double.parseDouble(tok.nextToken());
    }

    public String spar()
    {
        return tok.nextToken();
    }

    public static void main(String[] args) throws IOException
    {
        new D().go();
    }
}
