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

public class Task_D {

    private static class Vertex {
        Set<Integer> children = new HashSet<>();
        int num;

        public Vertex(int num, int n) {
            this.num = num;
        }

        @Override
        public boolean equals(Object o) {
            if (this == o) return true;
            if (o == null || getClass() != o.getClass()) return false;
            Vertex vertex = (Vertex) o;
            return num == vertex.num;
        }

        @Override
        public int hashCode() {
            return Objects.hash(num);
        }
    }

    public static void main(String[] args) {
        InputReader inputReader = new InputReader(System.in);
        int n = inputReader.nextInt();
        int m = inputReader.nextInt();

        Map<Integer, Vertex> graph = new HashMap<>();

        for (int i = 1; i <= n; i++) {
            graph.put(i, new Vertex(i, n));
        }

        int[][] edges = new int[m][2];
        for (int i = 0; i < m; i++) {
            int u = inputReader.nextInt();
            int v = inputReader.nextInt();
            graph.get(u).children.add(v);
            graph.get(v).children.add(u);

            edges[i][0] = u;
            edges[i][1] = v;
        }

        int[] result = new int[n + 1];
        result[1] = 1;
        Vertex vertex2 = null;
        Vertex vertex1 = graph.get(1);
        int v1 = 1;
        for (int i = 2; i <= n; i++) {
            if (!vertex1.children.contains(i)) {
                result[i] = 1;
                v1++;
            } else if (vertex2 == null) {
                vertex2 = graph.get(i);
                result[i] = 2;
            }
        }
        if (vertex2 == null) {
            System.out.println("-1");
            return;
        }
        int v2 = 1;
        int v3 = 0;
        for (int i = vertex2.num + 1; i <= n; i++) {
            if (!vertex2.children.contains(i) && result[i] == 0) {
                result[i] = 2;
                v2++;
            } else if (result[i] == 0){
                result[i] = 3;
                v3++;
            }
        }
        if (v3 == 0) {
            System.out.println("-1");
            return;
        }

        if (v1*v2 +v2*v3 +v1*v3 != m) {
            System.out.println("-1");
            return;
        }

        for (int[] edge : edges) {
            if (result[edge[0]] == result[edge[1]]) {
                System.out.println("-1");
                return;
            }
        }

        StringBuilder s = new StringBuilder();
        for (int j = 1; j < result.length; j++) {
            s.append(result[j]);
            if (j < n) {
                s.append(" ");
            }
        }
        System.out.println(s.toString());
    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public 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());
        }

    }
}
