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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.StringTokenizer;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.io.BufferedReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        OutputWriter out = new OutputWriter(outputStream);
        TaskD solver = new TaskD();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskD {
        boolean[] visited;
        List<HashSet<Integer>> graph;

        public void solve(int testNumber, InputReader in, OutputWriter out) {
            int N = in.nextInt(), M = in.nextInt();
            graph = new ArrayList<>();
            for (int i = 0; i < N; i++) {
                graph.add(new HashSet<>());
            }
            int setNumber[] = new int[N];
            int setCount[] = new int[4];
            visited = new boolean[N];
            for (int i = 0; i < M; i++) {
                int u = in.nextInt() - 1, v = in.nextInt() - 1;
                graph.get(u).add(v);
                graph.get(v).add(u);
            }
            setNumber[0] = 1;
            setCount[1]++;
            for (int i = 1; i < N; i++) {
                if (!graph.get(0).contains(i)) {
                    setNumber[i] = 1;
                    setCount[1]++;
                }
            }
            for (int i = 1; i < N; i++) {
                if (setNumber[i] == 0) {
                    setNumber[i] = 2;
                    setCount[2]++;
                    for (int j = i + 1; j < N; j++) {
                        if (!graph.get(i).contains(j)) {
                            setNumber[j] = 2;
                            setCount[2]++;
                        }
                    }
                    break;
                }
            }
            for (int i = 1; i < N; i++) {
                if (setNumber[i] == 0) {
                    setNumber[i] = 3;
                    setCount[3]++;
                    for (int j = i + 1; j < N; j++) {
                        if (!graph.get(i).contains(j)) {
                            setNumber[j] = 3;
                            setCount[3]++;
                        }
                    }
                    break;
                }
            }
            for (int i = 0; i < N; i++) {
                if (setNumber[i] == 0) {
                    out.printLine(-1);
                    return;
                }
            }
            for (int i = 1; i <= 3; i++) {
                int count = 0;
                if (setCount[i] == 0) {
                    out.printLine(-1);
                    return;
                }
                for (int j = 0; j < N; j++) {
                    if (setNumber[j] == i) {
                        int degeee = graph.get(j).size();
                        if (degeee != N - setCount[i]) {
                            out.printLine(-1);
                            return;
                        }
                        if (!visited[j]) {
                            dfs(j, setNumber, i);
                            count++;
                        }
                    }
                }
                if (count != setCount[i]) {
                    out.printLine(-1);
                    return;
                }
            }
            for (int i = 0; i < N; i++) {
                out.print(setNumber[i] + " ");
            }
        }

        public void dfs(int index, int setNumber[], int i) {
            visited[index] = true;
            for (Integer v : graph.get(index)) {
                if (!visited[v] && setNumber[v] == i) {
                    dfs(v, setNumber, i);
                }
            }
        }

    }

    static class OutputWriter {
        PrintWriter writer;

        public OutputWriter(OutputStream outputStream) {
            writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
        }

        public OutputWriter(Writer writer) {
            this.writer = new PrintWriter(writer);
        }

        public void print(Object... objects) {
            for (int i = 0; i < objects.length; i++) {
                if (i != 0) {
                    writer.print(' ');
                }
                writer.print(objects[i]);
            }
        }

        public void printLine(Object... objects) {
            print(objects);
            writer.println();
        }

        public void close() {
            writer.close();
        }

    }

    static class InputReader {
        BufferedReader in;
        StringTokenizer tokenizer = null;

        public InputReader(InputStream inputStream) {
            in = new BufferedReader(new InputStreamReader(inputStream));
        }

        public String next() {
            try {
                while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                    tokenizer = new StringTokenizer(in.readLine());
                }
                return tokenizer.nextToken();
            } catch (IOException e) {
                return null;
            }
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
}

